Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
 SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
 DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
 KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
 SIGIR 2001
 SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Roberto J. Bayardo Jr.

Papers on DiSC'02


Report on the Workshop on Research Issues in Data Mining and Knowledge Discovery Workshop (DMKD 2001).

Publications


Note: Links lead to the DBLP on the Web.

Roberto J. Bayardo Jr.

19 Rakesh Agrawal , Roberto J. Bayardo Jr., Daniel Gruhl , Spiros Papadimitriou : Vinci: a service-oriented architecture for rapid development of web applications. WWW 2001 : 355-365

18 Roberto J. Bayardo Jr., Johannes Gehrke : Report on the Workshop on Research Issues in Data Mining and Knowledge Discovery Workshop (DMKD 2001). SIGKDD Explorations 3 (1): 43-44 (2001)

17 Roberto J. Bayardo Jr., Joseph Daniel Pehoushek : Counting Models Using Connected Components. AAAI/IAAI 2000 : 157-162

16 Rakesh Agrawal , Roberto J. Bayardo Jr., Ramakrishnan Srikant : Athena: Mining-Based Interactive Management of Text Database. EDBT 2000 : 365-379

15 Roberto J. Bayardo Jr., Rakesh Agrawal , Dimitrios Gunopulos : Constraint-Based Rule Mining in Large, Dense Databases. Data Mining and Knowledge Discovery 4 (2/3): 217-240 (2000)

14 Roberto J. Bayardo Jr., Rakesh Agrawal , Dimitrios Gunopulos : Constraint-Based Rule Mining in Large, Dense Databases. ICDE 1999 : 188-197

13 Roberto J. Bayardo Jr., Rakesh Agrawal : Mining the Most Interesting Rules. KDD 1999 : 145-154

12 Roberto J. Bayardo Jr.: Efficiently Mining Long Patterns from Databases. SIGMOD Conference 1998 : 85-93

11 Roberto J. Bayardo Jr., Robert Schrag : Using CSP Look-Back Techniques to Solve Real-World SAT Instances. AAAI/IAAI 1997 : 203-208

10 Daniel P. Miranker , Roberto J. Bayardo Jr., Vasilis Samoladas : Query Evaluation as Constraint Search; An Overview of Early Results. CDB 1997 : 53-63

9 Roberto J. Bayardo Jr.: Brute-Force Mining of High-Confidence Classification Rules. KDD 1997 : 123-126

8 Roberto J. Bayardo Jr., Bill Bohrer , Richard S. Brice , Andrzej Cichocki , Jerry Fowler , Abdelsalam Helal , Vipul Kashyap , Tomasz Ksiezyk , Gale Martin , Marian H. Nodine , Mosfeq Rashid , Marek Rusinkiewicz , Ray Shea , C. Unnikrishnan , Amy Unruh , Darrell Woelk : InfoSleuth: Semantic Integration of Information in Open and Dynamic Environments (Experience Paper). SIGMOD Conference 1997 : 195-206

7 Roberto J. Bayardo Jr., Bill Bohrer , Richard S. Brice , Andrzej Cichocki , Jerry Fowler , Abdelsalam Helal , Vipul Kashyap , Tomasz Ksiezyk , Gale Martin , Marian H. Nodine , Mosfeq Rashid , Marek Rusinkiewicz , Ray Shea , C. Unnikrishnan , Amy Unruh , Darrell Woelk : The InfoSleuth Project. SIGMOD Conference 1997 : 543-545

6 Roberto J. Bayardo Jr., Daniel P. Miranker : A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem. AAAI/IAAI, Vol. 1 1996 : 298-304

5 Roberto J. Bayardo Jr., Daniel P. Miranker : Processing Queries for First Few Answers. CIKM 1996 : 45-52

4 Roberto J. Bayardo Jr., Robert Schrag : Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances. CP 1996 : 46-60

3 Roberto J. Bayardo Jr., Daniel P. Miranker : On the Space-Time Trade-off in Solving Constraint Satisfaction Problems. IJCAI 1995 : 558-562

2 James C. Browne , E. Allen Emerson , Mohamed G. Gouda , Daniel P. Miranker , Aloysius K. Mok , Roberto J. Bayardo Jr., Sarah E. Chodrow , David Gadbois , F. Furman Haddix , Thomas W. Hetherington , Lance Obermeyer , Duu-Chung Tsou , Chih-Kan Wang , Rwo-Hsi Wang : A New Approach to Modularity in Rule-Based Programming. ICTAI 1994 : 18-25

1 Roberto J. Bayardo Jr., Daniel P. Miranker : An Optimal Backtrack Algorithm for Tree-Structured Constraint Satisfaction problems. Artificial Intelligence 71 (1): 159-181 (1994)




DiSC'02 © 2003 Association for Computing Machinery