52 search results - page 6 / 11 » Improved Deletions in Dynamic Spatial Approximation Trees |
LATIN
1998
Springer
14 years 4 days ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...