226 search results - page 33 / 46 » Approximation algorithm for the kinetic robust K-center prob... |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
WADS
1997
Springer
14 years 3 days ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
This paper proposes an appearance generative mixture model based on key frames for meanshift tracking. Meanshift tracking algorithm tracks object by maximizing the similarity betwe...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...