159 search results - page 9 / 32 » Geometric Bounds for Generalization in Boosting |
SDM
2012
SIAM
11 years 9 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
ICRA
2005
IEEE
14 years 29 days ago
2005
IEEE
— This paper addresses the problem of classifying places in the environment of a mobile robot into semantic categories. We believe that semantic information about the type of pla...
DMTCS
2010
13 years 4 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
COMBINATORICS
2004
13 years 7 months ago
2004
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...