960 search results - page 162 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
231
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
153
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
100
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
145
Voted
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
209
Voted
ICDE
2001
IEEE
16 years 5 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...