2600 search results - page 32 / 520 » Clustering with or without the Approximation |
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
PAMI
2010
13 years 6 months ago
2010
—Representative surface reconstruction algorithms taking a gradient field as input enforces the integrability constraint in a discrete manner. While enforcing integrability allo...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
JCSS
2002
13 years 7 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
CG
2006
Springer
13 years 7 months ago
2006
Springer
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...