231 search results - page 3 / 47 » Sublinear time approximate clustering |
VLDB
2006
ACM
14 years 6 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
STACS
2007
Springer
14 years 5 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
CVPR
2007
IEEE
14 years 8 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
APPROX
2007
Springer
14 years 8 days ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...