Jayant Madhavan Papers on DiSC'04 The Piazza peer data management project Crossing the Structure Chasm Discovering Structure in a Corpus of Schemas Composing Mappings Among Data Sources Learning to match ontologies on the Semantic Web Publications Note: Links lead to the DBLP on the Web. Jayant Madhavan AnHai Doan , Jayant Madhavan, Pedro Domingos , Alon Y. Halevy : Ontology Matching: A Machine Learning Approach. Handbook on Ontologies 2004 : 385-404 Alon Y. Halevy , Oren Etzioni , AnHai Doan , Zachary G. Ives , Jayant Madhavan, Luke McDowell , Igor Tatarinov : Crossing the Structure Chasm. CIDR 2003 Alon Y. Halevy , Jayant Madhavan: Corpus-Based Knowledge Representation. IJCAI 2003 : 1567-1572 Jayant Madhavan, Alon Y. Halevy : Composing Mappings Among Data Sources. VLDB 2003 : 572-583 Mario A. Nascimento , Alon Y. Halevy , Jayant Madhavan, Philip A. Bernstein : Discovering Structure in a Corpus of Schemas. IEEE Data Eng. Bull. 26 (3): 26-33 (2003) Igor Tatarinov , Zachary G. Ives , Jayant Madhavan, Alon Y. Halevy , Dan Suciu , Nilesh N. Dalvi , Xin Dong , Yana Kadiyska , Gerome Miklau , Peter Mork : The Piazza peer data management project. SIGMOD Record 32 (3): 47-52 (2003) AnHai Doan , Jayant Madhavan, Robin Dhamankar , Pedro Domingos , Alon Y. Halevy : Learning to match ontologies on the Semantic Web. VLDB J. 12 (4): 303-319 (2003) Jayant Madhavan, Philip A. Bernstein , Pedro Domingos , Alon Y. Halevy : Representing and Reasoning about Mappings between Domain Models. AAAI/IAAI 2002 : 80-86 AnHai Doan , Jayant Madhavan, Pedro Domingos , Alon Y. Halevy : Learning to map between ontologies on the semantic web. WWW 2002 : 662-673 Jayant Madhavan, Philip A. Bernstein , Erhard Rahm : Generic Schema Matching with Cupid. VLDB 2001 : 49-58 Zachary G. Ives , Alon Y. Levy , Jayant Madhavan, Rachel Pottinger , Stefan Saroiu , Igor Tatarinov , Shiori Betzler , Qiong Chen , Ewa Jaslikowska , Jing Su , Wai Tak Theodora Yeung : Self-Organizing Data Sharing Communities with SAGRES. SIGMOD Conference 2000 : 582 1 [ 2 ] [ 4 ] [ 7 ] 2 [ 1 ] 3 [ 1 ] 4 [ 6 ] 5 [ 5 ] 6 [ 3 ] [ 5 ] [ 10 ] [ 11 ] 7 [ 3 ] [ 4 ] [ 5 ] [ 11 ] 8 [ 6 ] 9 [ 10 ] 10 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] 11 [ 1 ] [ 6 ] [ 10 ] 12 [ 1 ] 13 [ 6 ] 14 [ 1 ] 15 [ 10 ] 16 [ 6 ] 17 [ 6 ] 18 [ 7 ] 19 [ 1 ] 20 [ 2 ] 21 [ 1 ] 22 [ 1 ] 23 [ 6 ] 24 [ 1 ] [ 6 ] [ 10 ] 25 [ 1 ] ©2004 Association for Computing Machinery