29 search results - page 4 / 6 » Generalizing Halfspaces |
83
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
COLT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
79
Voted
COMPGEOM
1987
ACM
15 years 1 months ago
1987
ACM
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...