96 search results - page 13 / 20 » Restructuring ordered binary trees |
129
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 ...
BIRTHDAY
2008
Springer
14 years 11 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
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...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
CVPR
1998
IEEE
15 years 11 months ago
1998
IEEE
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...