4541 search results - page 270 / 909 » Cache-Oblivious Algorithms and Data Structures |
130
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
122
Voted
CIKM
1994
Springer
15 years 7 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
144
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
131
Voted
AAAI
2000
15 years 5 months ago
2000
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
120
click to vote
SMC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— The underwater environment presents many challenges for robotic sensing including highly variable lighting, the presence of dynamic objects, and the six degree of freed...