1768 search results - page 235 / 354 » Mining Very Large Databases |
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
142
click to vote
VISUAL
1999
Springer
15 years 8 months ago
1999
Springer
This paper describes the application of techniques derived from text retrieval research to the content-based querying of image databases. Speci cally, the use of inverted les, fre...
149
click to vote
VLDB
1990
ACM
15 years 7 months ago
1990
ACM
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
149
click to vote
DASFAA
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
130
click to vote
SIGMOD
1991
ACM
15 years 7 months ago
1991
ACM
This paper presents an architecture for a persistent object store in which multi-level storage is explicitly included. Traditionally, DBMSs have assumed that all accessible data r...