673 search results - page 104 / 135 » Querying Continuous Time Sequences |
85
Voted
CGF
2002
15 years 9 days ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
113
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
135
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
112
click to vote
AMR
2005
Springer
15 years 6 months ago
2005
Springer
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...
81
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of ...