| 2011 | ||
|---|---|---|
| j12 | Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth: Noise-based Deterministic Logic and Computing: a Brief Survey. IJUC 7(1-2): 101-113 (2011) | |
| i4 | Tamás Horváth, Laszlo B. Kish, Jacob Scheuer: Effective Privacy Amplification for Secure Classical Communications. CoRR abs/1101.4264 (2011) | |
| i3 | Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth: Noise-based information processing: Noise-based logic and computing: what do we have so far? CoRR abs/1102.2256 (2011) | |
| 2010 | ||
| j11 | Tamás Horváth, Jan Ramon, Stefan Wrobel: Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21(3): 472-508 (2010) | |
| j10 | Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411(3): 691-700 (2010) | |
| j9 | Tamás Horváth, Jan Ramon: Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci. 411(31-33): 2784-2797 (2010) | |
| r2 | Thomas Gärtner, Tamás Horváth, Stefan Wrobel: Graph Kernels. Encyclopedia of Machine Learning 2010: 467-469 | |
| r1 | Tamás Horváth, Stefan Wrobel: Learning from Structured Data. Encyclopedia of Machine Learning 2010: 580-584 | |
| i2 | Laszlo B. Kish, Sunil P. Khatri, Tamás Horváth: Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel. CoRR abs/1005.1560 (2010) | |
| i1 | Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth: Noise-based deterministic logic and computing: a brief survey. CoRR abs/1007.5282 (2010) | |
| 2009 | ||
| j8 | Mario Boley, Tamás Horváth, Stefan Wrobel: Efficient discovery of interesting patterns based on strong closedness. Statistical Analysis and Data Mining 2(5-6): 346-360 (2009) | |
| c26 | Tamás Horváth, Gerhard Paass, Frank Reichartz, Stefan Wrobel: A Logic-Based Approach to Relation Extraction from Texts. ILP 2009: 34-48 | |
| c25 | Mario Boley, Tamás Horváth, Stefan Wrobel: Efficient Discovery of Interesting Patterns Based on Strong Closedness. SDM 2009: 1002-1013 | |
| 2008 | ||
| c24 | Tamás Horváth, Jan Ramon: Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. ECML/PKDD (1) 2008: 520-535 | |
| e2 | Jean-François Boulicaut, Michael R. Berthold, Tamás Horváth (Eds.): Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings. Lecture Notes in Computer Science 5255, Springer 2008, isbn 978-3-540-88410-1 | |
| 2007 | ||
| c23 | Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG 2007 | |
| c22 | Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). PKDD 2007: 382-389 | |
| c21 | Tamás Horváth, Tibor Sulyán: A Framework for Testing AIS Implementations. TestCom/FATES 2007: 186-198 | |
| 2006 | ||
| j7 | ||
| c20 | ||
| c19 | Tamás Horváth, Jan Ramon, Stefan Wrobel: Frequent subgraph mining in outerplanar graphs. KDD 2006: 197-206 | |
| c18 | Tamás Horváth, Jan Ramon, Stefan Wrobel: Frequent Subgraph Mining in Outerplanar Graphs. LWA 2006: 290-296 | |
| c17 | Tamás Horváth, Susanne Hoche, Stefan Wrobel: Effective rule induction from labeled graphs. SAC 2006: 611-616 | |
| 2005 | ||
| c16 | ||
| c15 | ||
| 2004 | ||
| c14 | Tamás Horváth, Thomas Gärtner, Stefan Wrobel: Cyclic pattern kernels for predictive graph mining. KDD 2004: 158-167 | |
| 2003 | ||
| e1 | Tamás Horváth (Ed.): Inductive Logic Programming: 13th International Conference, ILP 2003, Szeged, Hungary, September 29-October 1, 2003, Proceedings. Lecture Notes in Computer Science 2835, Springer 2003, isbn 3-540-20144-0 | |
| 2001 | ||
| j6 | Tamás Horváth, György Turán: Learning logic programs with structured background knowledge. Artif. Intell. 128(1-2): 31-97 (2001) | |
| j5 | Tamás Horváth, Stefan Wrobel, Uta Bohnebeck: Relational Instance-Based Learning with Lists and Terms. Machine Learning 43(1/2): 53-80 (2001) | |
| c13 | Tamás Horváth, Stefan Wrobel: Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity. Discovery Science 2001: 100-112 | |
| 2000 | ||
| j4 | László Szirmay-Kalos, Gábor Márton, Tibor Fóris, Tamás Horváth: Development of process visualization systems: An object-oriented approach. Journal of Systems Architecture 46(3): 275-296 (2000) | |
| c12 | Valér Canda, Tran van Trung, Spyros S. Magliveras, Tamás Horváth: Symmetric Block Ciphers Based on Group Bases. Selected Areas in Cryptography 2000: 89-105 | |
| 1999 | ||
| c11 | ||
| c10 | Tamás Horváth, Zoltán Alexin, Tibor Gyimóthy, Stefan Wrobel: Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. ILP 1999: 128-139 | |
| 1998 | ||
| c9 | Uta Bohnebeck, Werner Sälter, Tamás Horváth, Stefan Wrobel, Dietmar Blohm: Measuring similarity of RNA structures by relational instance-based learning: A first step toward detecting RNA signal structures in silico. German Conference on Bioinformatics 1998 | |
| c8 | Uta Bohnebeck, Tamás Horváth, Stefan Wrobel: Term Comparisons in First-Order Similarity Measures. ILP 1998: 65-79 | |
| 1997 | ||
| j3 | Tibor Gyimóthy, Tamás Horváth: Learning Semantic Functions of Attribute Grammars. Nord. J. Comput. 4(2): 287-302 (1997) | |
| c7 | Tamás Horváth, Robert H. Sloan, György Turán: Learning Logic Programs by Using the Product Homomorphism Method. COLT 1997: 10-20 | |
| 1996 | ||
| c6 | Tamás Horváth, Robert H. Sloan, György Turán: Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop 1996: 315-336 | |
| 1994 | ||
| j2 | Bern Martens, Danny De Schreye, Tamás Horváth: Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. Theor. Comput. Sci. 122(1&2): 97-117 (1994) | |
| c5 | Tamás Horváth, Spyros S. Magliveras, Tran van Trung: A Parallel Permutation Multiplier for a PGM Crypto-chip. CRYPTO 1994: 108-113 | |
| 1992 | ||
| j1 | Tamás Horváth, Gábor Márton, Peter Risztics, László Szirmay-Kalos: Ray Coherence Between a Sphere and a Convex Polyhedron. Comput. Graph. Forum 11(2): 163-172 (1992) | |
| 1990 | ||
| c4 | Tamás Horváth, Zoltán Alexin, Tibor Gyimóthy, Károly Fábricz: Towards a Multilingual Natural Language Understanding Interface (Extended Abstract). CC 1990: 217-218 | |
| c3 | Károly Fábricz, Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth: THALES: a Software Package for Plane Geometry Constructions with a Natural Language Interface. COLING 1990: 44-46 | |
| c2 | Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth, Károly Fábricz: Attribute Grammar Specification for a Natural Language Understanding Interface. WAGA 1990: 313-326 | |
| 1988 | ||
| c1 | Tibor Gyimóthy, Tamás Horváth, Ferenc Kocsis, János Toczki: Incremental Algorithms in Prof-LP. CC 1988: 93-102 | |
Colors in the list of coauthors
Last update Sat May 18 13:51:47 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page