 |
|
Online DBLP entries are available for Jr. Roberto J. Bayardo and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
- Roberto J. Bayardo Jr.,
Rakesh Agrawal
,
Dimitrios Gunopulos
:
Constraint-Based Rule Mining in Large, Dense Databases.
ICDE 1999
: 188-197
- 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.,
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
- 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
- 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
- Roberto J. Bayardo Jr.,
Daniel P. Miranker
:
An Optimal Backtrack Algorithm for Tree-Structured Constraint Satisfaction problems.
Artificial Intelligence 71
(1): 159-181 (1994)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
