Sciweavers

4536 search results - page 284 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CIKM
1994
Springer
15 years 10 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
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...
Walid G. Aref, Hanan Samet
210
Voted
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 8 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
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...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
AAAI
2000
15 years 8 months ago
Multivariate Clustering by Dynamics
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...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
SMC
2007
IEEE
127views Control Systems» more  SMC 2007»
16 years 29 days ago
Underwater environment reconstruction using stereo and inertial data
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...
Andrew Hogue, Andrew German, Michael Jenkin
MICCAI
2009
Springer
16 years 7 months ago
Steerable Features for Statistical 3D Dendrite Detection
Most state-of-the-art algorithms for filament detection in 3?D image-stacks rely on computing the Hessian matrix around individual pixels and labeling these pixels according to its...
François Aguet, François Fleuret, Ge...