Sciweavers

4039 search results - page 190 / 808
» A Method for Dynamic Clustering of Data
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
191
Voted
IPPS
2010
IEEE
15 years 3 months ago
Robust control-theoretic thermal balancing for server clusters
Thermal management is critical for clusters because of the increasing power consumption of modern processors, compact server architectures and growing server density in data center...
Yong Fu, Chenyang Lu, Hongan Wang
PAMI
2010
164views more  PAMI 2010»
15 years 3 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 5 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
15 years 11 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt