605 search results - page 34 / 121 » Geometrical Structure of Boosting Algorithm |
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
132
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
109
click to vote
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
This paper concerns the building of enhanced scene maps during real-time monocular SLAM. Specifically, we present a novel algorithm for detecting and estimating planar structure i...
DSSCV
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Blurring an image with a Gaussian of width σ and considering σ as an extra dimension, extends the image to an Gaussian scale space (GSS) image. In this GSS-image the is...