1167 search results - page 71 / 234 » Limits of Spectral Clustering |
132
click to vote
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
We have implemented a virtual machine (VM) for Java which executes on a cluster. Our cluster VM completely hides the cluster from the application, presenting a single system image...
156
click to vote
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
190
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
131
click to vote
VLDB
2002
ACM
15 years 4 months ago
2002
ACM
Data warehouses offer a compromise between freshness of data and query evaluation times. However, a fixed preference ratio between these two variables is too undifferentiated. Wit...
138
click to vote
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
Results of any clustering algorithm are highly sensitive to features that limit their generalization and hence provide a strong motivation to integrate shape information into the ...