Sciweavers

288 search results - page 23 / 58
» Ripple presentation for tree structures with historical info...
Sort
View
VRST
2009
ACM
14 years 2 months ago
Indexing and retrieval of human motion data by a hierarchical tree
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Shuangyuan Wu, Zhaoqi Wang, Shihong Xia
SPIRE
2009
Springer
14 years 2 months ago
Indexing Variable Length Substrings for Exact and Approximate Matching
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...
Gonzalo Navarro, Leena Salmela
RAS
2010
142views more  RAS 2010»
13 years 5 months ago
Closing the loop in appearance-guided omnidirectional visual odometry by using vocabulary trees
In this paper, we present a method that allows us to recover the trajectory of a vehicle purely from monocular omnidirectional images very accurately. The method uses a combination...
Davide Scaramuzza, Friedrich Fraundorfer, Marc Pol...
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
13 years 11 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
IFIP
2004
Springer
14 years 26 days ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...