Sciweavers

13 search results - page 2 / 3
» Largest and Smallest Convex Hulls for Imprecise Points
Sort
View
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 5 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
CCCG
2006
13 years 7 months ago
Removing Outliers to Minimize Area and Perimeter
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
Rossen Atanassov, Pat Morin, Stefanie Wuhrer
ISVD
2007
IEEE
13 years 11 months ago
Time Convex Hull with a Highway
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
Teng-Kai Yu, D. T. Lee
ICML
2000
IEEE
14 years 6 months ago
Duality and Geometry in SVM Classifiers
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
Kristin P. Bennett, Erin J. Bredensteiner
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 5 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri