5962 search results - page 166 / 1193 » Efficient Clustering for Orders |
207
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
184
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
We recently introduced symbolic timing simulation (STS) using data-dependent delays as a tool for verifying the timing of fullcustom transistor-level circuit designs, and for the ...
165
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
146
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
218
click to vote
ICCCN
2007
IEEE
15 years 10 months ago
2007
IEEE
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...