Sciweavers

198 search results - page 10 / 40
» Dynamic spatial approximation trees
Sort
View
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 9 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
PAMI
2011
13 years 4 months ago
Bilayer Segmentation of Webcam Videos Using Tree-Based Classifiers
—This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The ...
Pei Yin, Antonio Criminisi, John M. Winn, Irfan A....
UAI
2008
13 years 11 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 3 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CVPR
2005
IEEE
14 years 12 months ago
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
Qiang Ji, Yang Wang 0002