960 search results - page 63 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
153
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
126
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
130
Voted
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In one-class classification we seek a rule to find a coherent subset of instances similar to a few positive examples in a large pool of instances. The problem can be formulated an...
131
click to vote
CAP
2010
14 years 11 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...