1161 search results - page 64 / 233 » Approximation schemes for clustering problems |
NIPS
2007
15 years 1 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
127
click to vote
TIP
2002
14 years 11 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
111
click to vote
EMMCVPR
2005
Springer
15 years 5 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
107
click to vote
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...