Sciweavers

76 search results - page 3 / 16
» Fast approximation of convex hull
Sort
View
ICML
2008
IEEE
14 years 5 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
SIAMJO
2002
73views more  SIAMJO 2002»
13 years 4 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 4 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
PODS
2003
ACM
116views Database» more  PODS 2003»
14 years 4 months ago
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
Charu C. Aggarwal, Dakshi Agrawal
ICML
2000
IEEE
14 years 5 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