5595 search results - page 25 / 1119 » Approximation Algorithms for Clustering Problems |
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
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...
130
click to vote
FSTTCS
1993
Springer
15 years 3 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...
SDM
2010
SIAM
15 years 1 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 11 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...