847 search results - page 71 / 170 » Approximation algorithms for projective clustering |
134
Voted
KDD
2012
ACM
13 years 3 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
KDD
2008
ACM
16 years 1 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
129
click to vote
KDD
2004
ACM
15 years 6 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
84
Voted
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
97
Voted
SCIA
2005
Springer
15 years 6 months ago
2005
Springer
Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clusteri...