960 search results - page 152 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
351
Voted
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
144
Voted
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
135
Voted
VLDB
2000
ACM
15 years 7 months ago
2000
ACM
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
251
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
136
Voted
KDD
2005
ACM
15 years 9 months ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...