| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Shlomo Argamon Shlomo Argamon, Mark Olsen : Toward meaningful computing. Commun. ACM 49 (4): 33-35 (2006) Casey Whitelaw , Navendu Garg , Shlomo Argamon: Using appraisal groups for sentiment analysis. CIKM 2005 : 625-631 Shlomo Argamon, Nazli Goharian , David A. Grossman , Ophir Frieder , N. Raju : A Specialization in Information and Knowledge Management Systems for the Undergraduate Computer Science Curriculum. ITCC (1) 2005 : 476-481 Shlomo Argamon, Jussi Karlgren , James G. Shanahan : Future short term goals of research in computational analysis of stylistics in text. SIGIR Forum 39 (2): 17-18 (2005) Shlomo Argamon, Marin Saric , Sterling Stuart Stein : Style mining of electronic messages for multiple authorship discrimination: first results. KDD 2003 : 475-480 Julio Ortega , Moshe Koppel , Shlomo Argamon: Arbitrating Among Competing Classifiers Using Learned Referees. Knowl. Inf. Syst. 3 (4): 470-490 (2001) Shlomo Argamon-Engelson, Moshe Koppel , Hillel Walters : Maximizing Theory Accuracy Through Selective Reinterpretation. Machine Learning 41 (2): 123-152 (2000) Shlomo Argamon-Engelson, Sarit Kraus , Sigalit Sina : Interleaved Versus A Priori Exploration for Repeated Navigation in a Partially-Known Graph. IJPRAI 13 (7): 963-896 (1999) Shlomo Argamon-Engelson, Ido Dagan : Committee-Based Sample Selection for Probabilistic Classifiers. J. Artif. Intell. Res. (JAIR) 11 : 335-360 (1999) Shlomo Argamon-Engelson, Ido Dagan , Yuval Krymolowski : A memory-based approach to learning shallow natural language patterns. J. Exp. Theor. Artif. Intell. 11 (3): 369-390 (1999) Shlomo Argamon, Ido Dagan , Yuval Krymolowski : A Memory-Based Approach to Learning Shallow Natural Language Patterns. COLING-ACL 1998 : 67-73 Shlomo Argamon-Engelson, Sarit Kraus , Sigalit Sina : Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph. Artif. Intell. 101 (1-2): 267-284 (1998) Shlomo Argamon, Ido Dagan , Yuval Krymolowski : A Memory-Based Approach to Learning Shallow Natural Language Patterns CoRR cmp-lg/9806011 : (1998) Shlomo Argamon-Engelson, Moshe Koppel : Tractability of Theory Patching CoRR cs.AI/9803103 : (1998) Shlomo Argamon-Engelson, Moshe Koppel : Tractability of Theory Patching. J. Artif. Intell. Res. (JAIR) 8 : 39-65 (1998) Shlomo Argamon-Engelson: Using image signatures for place recognition. Pattern Recognition Letters 19 (10): 941-951 (1998) Sean P. Engelson: Learning Robust Plans for Mobile Robots from a Single Trial. AAAI/IAAI, Vol. 1 1996 : 869-874 Sean P. Engelson, Ido Dagan : Minimizing Manual Annotation Cost in Supervised Training from Corpora. ACL 1996 : 319-326 Sean P. Engelson, Moshe Koppel : Identifying the Information Contained in a Flawed Theory. ICML 1996 : 131-138 Sean P. Engelson, Ido Dagan : Minimizing Manual Annotation Cost In Supervised Training From Corpora CoRR cmp-lg/9606030 : (1996) Ido Dagan , Sean P. Engelson: Committee-Based Sampling For Training Probabilistic Classifiers. ICML 1995 : 150-157 Sean P. Engelson, Moshe Koppel : Distilling Reliable Information From Unreliable Theories. ICML 1995 : 218-225 Sean P. Engelson, Ido Dagan : Sample selection in natural language learning. Learning for Natural Language Processing 1995 : 230-245 Thomas Dean , Dana Angluin , Kenneth Basye , Sean P. Engelson, Leslie Pack Kaelbling , Evangelos Kokkevis , Oded Maron : Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. Machine Learning 18 (1): 81-108 (1995) Gregory D. Hager , Sean P. Engelson, Sami Atiya : On Comparing Statistical and Set-Based Methods in Sensor Data Fusion. ICRA (2) 1993 : 352-358 Thomas Dean , Dana Angluin , Kenneth Basye , Sean P. Engelson, Leslie Pack Kaelbling , Evangelos Kokkevis , Oded Maron : Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. AAAI 1992 : 208-214 1 [ 1 ] [ 3 ] 2 [ 2 ] 3 [ 1 ] [ 3 ] 4 [ 4 ] [ 6 ] [ 7 ] [ 9 ] [ 14 ] [ 16 ] [ 17 ] [ 18 ] 5 [ 1 ] [ 3 ] 6 [ 24 ] 7 [ 25 ] 8 [ 24 ] 9 [ 24 ] 10 [ 2 ] 11 [ 1 ] [ 3 ] 12 [ 23 ] 13 [ 1 ] [ 3 ] 14 [ 5 ] [ 8 ] [ 12 ] [ 13 ] [ 20 ] [ 21 ] 15 [ 15 ] [ 19 ] 16 [ 14 ] [ 16 ] [ 17 ] 17 [ 1 ] [ 3 ] 18 [ 26 ] 19 [ 21 ] 20 [ 24 ] 21 [ 22 ] 22 [ 23 ] 23 [ 15 ] [ 19 ] 24 [ 22 ] 25 [ 20 ] 26 [ 25 ]  ©2006 Association for Computing Machinery |
