847 search results - page 54 / 170 » Approximation algorithms for projective clustering |
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
97
Voted
CSDA
2010
15 years 21 days ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
88
Voted
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
123
Voted
COMPGEOM
2000
ACM
15 years 5 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
106
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...