256 search results - page 27 / 52 » Approximation Algorithms for Hamming Clustering Problems |
68
Voted
NIPS
2007
14 years 11 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...
111
click to vote
FSTTCS
1993
Springer
15 years 1 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
75
Voted
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...