1709 search results - page 167 / 342 » Comparing the Performance of Database Selection Algorithms |
156
click to vote
ICDM
2005
IEEE
15 years 12 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
276
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
220
click to vote
SSDBM
2009
IEEE
16 years 1 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
199
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
217
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...