![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Roni Khardon Naoki Abe , Roni Khardon: Foreword. Theor. Comput. Sci. 313 (2): 173-174 (2004) Marta Arias , Roni Khardon, Rocco A. Servedio : Polynomial Certificates for Propositional Classes. COLT 2003 : 537-551 Roni Khardon, Rocco A. Servedio : Maximum Margin Algorithms with Boolean Kernels. COLT 2003 : 87-101 Marta Arias , Roni Khardon: Complexity Parameters for First-Order Classes. ILP 2003 : 22-37 Dimitrios Gunopulos , Roni Khardon, Heikki Mannila , Sanjeev Saluja , Hannu Toivonen , Ram Sewak Sharm : Discovering all most specific sentences. ACM Trans. Database Syst. 28 (2): 140-174 (2003) Marta Arias , Roni Khardon: Learning Closed Horn Expressions. Inf. Comput. 178 (1): 214-240 (2002) Naoki Abe , Roni Khardon, Thomas Zeugmann : Algorithmic Learning Theory, 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, Proceedings Springer 2001 Naoki Abe , Roni Khardon, Thomas Zeugmann : Editors' Introduction. ALT 2001 : 1-8 Roni Khardon, Dan Roth , Rocco A. Servedio : Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms. NIPS 2001 : 423-430 Roni Khardon: Learning Horn Expressions with LogAn-H. ICML 2000 : 471-478 Marta Arias , Roni Khardon: A New Algorithm for Learning Range Restricted Horn Expressions. ILP 2000 : 21-39 Roni Khardon: Learning Range Restricted Horn Expressions. EuroCOLT 1999 : 111-125 Roni Khardon, Dan Roth , Leslie G. Valiant : Relational Learning for NLP using Linear Threshold Elements. IJCAI 1999 : 911-919 Roni Khardon, Heikki Mannila , Dan Roth : Reasoning with Examples: Propositional Formulae and Database Dependencies. Acta Inf. 36 (4): 267-286 (1999) Roni Khardon: Learning Action Strategies for Planning Domains. Artif. Intell. 113 (1-2): 125-148 (1999) Roni Khardon: Learning to Take Actions. Machine Learning 35 (1): 57-90 (1999) Roni Khardon, Dan Roth : Learning to Reason with a Restricted View. Machine Learning 35 (2): 95-116 (1999) Roni Khardon: Learning Function-Free Horn Expressions. Machine Learning 37 (3): 241-275 (1999) Roni Khardon: Learning First Order Universal Horn Expressions. COLT 1998 : 154-165 Howard Aizenstein , Avrim Blum , Roni Khardon, Eyal Kushilevitz , Leonard Pitt , Dan Roth : On Learning Read-k-Satisfy-j DNF. SIAM J. Comput. 27 (6): 1515-1530 (1998) Dimitrios Gunopulos , Roni Khardon, Heikki Mannila , Hannu Toivonen : Data mining, Hypergraph Transversals, and Machine Learning. PODS 1997 : 209-216 Roni Khardon, Dan Roth : Defaults and Relevance in Model-Based Reasoning. Artif. Intell. 97 (1-2): 169-193 (1997) Roni Khardon, Dan Roth : Learning to reason. J. ACM 44 (5): 697-725 (1997) Roni Khardon: Learning to Take Actions. AAAI/IAAI, Vol. 1 1996 : 787-792 Roni Khardon, Dan Roth : Reasoning with Models. Artif. Intell. 87 (1-2): 187-213 (1996) Roni Khardon, Shlomit S. Pinter : Partitioning and Scheduling to Counteract Overhead. Parallel Computing 22 (4): 555-593 (1996) Roni Khardon, Dan Roth : Learning to Reason with a Restricted View. COLT 1995 : 301-310 Roni Khardon, Dan Roth : Default-Reasoning with Models. IJCAI 1995 : 319-327 Roni Khardon: Translating between Horn Representations and their Characteristic Models. JAIR 3 : 349-372 (1995) Roni Khardon, Dan Roth : Reasoning with Models. AAAI 1994 : 1148-1153 Roni Khardon, Dan Roth : Learning to Reason. AAAI 1994 : 682-687 Avrim Blum , Roni Khardon, Eyal Kushilevitz , Leonard Pitt , Dan Roth : On Learning Read- k -Satisfy- j DNF. COLT 1994 : 110-117 Roni Khardon: On Using the Fourier Transform to Learn Disjoint DNF. Inf. Process. Lett. 49 (5): 219-222 (1994) 1 [ 26 ] [ 27 ] [ 33 ] 2 [ 14 ] 3 [ 23 ] [ 28 ] [ 30 ] [ 32 ] 4 [ 2 ] [ 14 ] 5 [ 13 ] [ 29 ] 6 [ 2 ] [ 14 ] 7 [ 13 ] [ 20 ] [ 29 ] 8 [ 8 ] 9 [ 2 ] [ 14 ] 10 [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 9 ] [ 11 ] [ 12 ] [ 14 ] [ 17 ] [ 20 ] [ 21 ] [ 25 ] 11 [ 29 ] 12 [ 25 ] [ 31 ] [ 32 ] 13 [ 29 ] 14 [ 13 ] [ 29 ] 15 [ 21 ] 16 [ 26 ] [ 27 ] ![]() ©2004 Association for Computing Machinery |