| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Roberto J. Bayardo Jr. Mayank Bawa , Roberto J. Bayardo Jr., Rakesh Agrawal : Privacy-Preserving Indexing of Documents on the Network. VLDB 2003 : 922-933 Mayank Bawa , Roberto J. Bayardo Jr., Sridhar Rajagopalan , Eugene J. Shekita : Make it fresh, make it quick: searching a network of personal webservers. WWW 2003 : 577-586 Roberto J. Bayardo Jr., Ramakrishnan Srikant : Technological Solutions for Protecting Privacy. IEEE Computer 36 (9): 115-118 (2003) Roberto J. Bayardo Jr., Rakesh Agrawal , Daniel Gruhl , Amit Somani : YouServ: a web-hosting and content sharing tool for the masses. WWW 2002 : 345-354 Rakesh Agrawal , Roberto J. Bayardo Jr., Daniel Gruhl , Spiros Papadimitriou : Vinci: a service-oriented architecture for rapid development of Web applications. Computer Networks 39 (5): 523-539 (2002) 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 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) Roberto J. Bayardo Jr., Joseph Daniel Pehoushek : Counting Models Using Connected Components. AAAI/IAAI 2000 : 157-162 Rakesh Agrawal , Roberto J. Bayardo Jr., Ramakrishnan Srikant : Athena: Mining-Based Interactive Management of Text Database. EDBT 2000 : 365-379 Roberto J. Bayardo Jr., Rakesh Agrawal , Dimitrios Gunopulos : Constraint-Based Rule Mining in Large, Dense Databases. Data Min. Knowl. Discov. 4 (2/3): 217-240 (2000) Roberto J. Bayardo Jr., Rakesh Agrawal , Dimitrios Gunopulos : Constraint-Based Rule Mining in Large, Dense Databases. ICDE 1999 : 188-197 Roberto J. Bayardo Jr., Rakesh Agrawal : Mining the Most Interesting Rules. KDD 1999 : 145-154 Roberto J. Bayardo Jr.: Efficiently Mining Long Patterns from Databases. SIGMOD Conference 1998 : 85-93 Roberto J. Bayardo Jr., Robert Schrag : Using CSP Look-Back Techniques to Solve Real-World SAT Instances. AAAI/IAAI 1997 : 203-208 Daniel P. Miranker , Roberto J. Bayardo Jr., Vasilis Samoladas : Query Evaluation as Constraint Search; An Overview of Early Results. CDB 1997 : 53-63 Roberto J. Bayardo Jr.: Brute-Force Mining of High-Confidence Classification Rules. KDD 1997 : 123-126 Roberto J. Bayardo Jr., William 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 Roberto J. Bayardo Jr., William 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 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 Roberto J. Bayardo Jr., Daniel P. Miranker : Processing Queries for First Few Answers. CIKM 1996 : 45-52 Roberto J. Bayardo Jr., Robert Schrag : Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances. CP 1996 : 46-60 Roberto J. Bayardo Jr., Daniel P. Miranker : On the Space-Time Trade-off in Solving Constraint Satisfaction Problems. IJCAI 1995 : 558-562 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 Roberto J. Bayardo Jr., Daniel P. Miranker : An Optimal Backtrack Algorithm for Tree-Structured Constraint Satisfaction problems. Artif. Intell. 71 (1): 159-181 (1994) 1 [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 19 ] [ 20 ] [ 21 ] [ 24 ] 2 [ 23 ] [ 24 ] 3 [ 7 ] [ 8 ] 4 [ 7 ] [ 8 ] 5 [ 2 ] 6 [ 2 ] 7 [ 7 ] [ 8 ] 8 [ 2 ] 9 [ 7 ] [ 8 ] 10 [ 2 ] 11 [ 18 ] 12 [ 2 ] 13 [ 19 ] [ 20 ] [ 21 ] 14 [ 14 ] [ 15 ] 15 [ 2 ] 16 [ 7 ] [ 8 ] 17 [ 2 ] 18 [ 7 ] [ 8 ] 19 [ 7 ] [ 8 ] 20 [ 7 ] [ 8 ] 21 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 10 ] 22 [ 2 ] 23 [ 7 ] [ 8 ] 24 [ 2 ] 25 [ 19 ] [ 20 ] 26 [ 17 ] 27 [ 23 ] 28 [ 7 ] [ 8 ] 29 [ 7 ] [ 8 ] 30 [ 10 ] 31 [ 4 ] [ 11 ] 32 [ 7 ] [ 8 ] 33 [ 23 ] 34 [ 21 ] 35 [ 16 ] [ 22 ] 36 [ 2 ] 37 [ 7 ] [ 8 ] 38 [ 7 ] [ 8 ] 39 [ 2 ] 40 [ 2 ] 41 [ 7 ] [ 8 ]  ©2004 Association for Computing Machinery |
