Sciweavers

673 search results - page 104 / 135
» Querying Continuous Time Sequences
Sort
View
CGF
2002
116views more  CGF 2002»
15 years 4 months ago
Deferred, Self-Organizing BSP Trees
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...
Sigal Ar, Gil Montag, Ayellet Tal
COMPGEOM
2006
ACM
15 years 10 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
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...
Yevgeny Schreiber, Micha Sharir
COMPGEOM
2011
ACM
14 years 8 months ago
Reeb graphs: approximation and persistence
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...
Tamal K. Dey, Yusu Wang
AMR
2005
Springer
137views Multimedia» more  AMR 2005»
15 years 10 months ago
Information Retrieval of Sequential Data in Heterogeneous XML Databases
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...
Eugen Popovici, Pierre-Francois Marteau, Gildas M&...
WWW
2009
ACM
16 years 5 months ago
Detecting the origin of text segments efficiently
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 ...
Ossama Abdel Hamid, Behshad Behzadi, Stefan Christ...