221 search results - page 11 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
PR
2007
13 years 7 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
FMSD
2006
13 years 7 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
SIAMSC
2010
13 years 6 months ago
2010
In this paper we propose a class of high order numerical methods to delta function integrals appearing in level set methods in the three dimensional case by extending the idea for ...