1388 search results - page 230 / 278 » Querying Linguistic Trees |
3DIM
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
119
Voted
SSDBM
2003
IEEE
15 years 5 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
108
click to vote
SSD
2001
Springer
15 years 4 months ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
123
Voted
VR
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a framework for fast and accurate collision detection for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, ...
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...