960 search results - page 134 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
148
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
125
Voted
IDEAL
2003
Springer
15 years 9 months ago
2003
Springer
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
225
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
118
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
126
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...