839 search results - page 133 / 168 » Three-Clustering of Points in the Plane |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
84
Voted
KDD
2000
ACM
15 years 1 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
76
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Single-track vehicles, such as motorcycles, provide an agile mobile platform. Modeling and control of motorcycles for agile maneuvers, such as those by professional racing ride...