Sciweavers

564 search results - page 43 / 113
» Error-tolerant Tree Matching
Sort
View
ICIP
2005
IEEE
16 years 5 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies
94
Voted
ICEIS
2009
IEEE
15 years 10 months ago
A Natural and Multi-layered Approach to Detect Changes in Tree-Based Textual Documents
Several efficient and very powerful algorithms exist for detecting changes in tree-based textual documents, such as those encoded in XML. An important aspect is still underestimat...
Angelo Di Iorio, Michele Schirinzi, Fabio Vitali, ...
NBIS
2007
Springer
15 years 9 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
15 years 5 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...
CVPR
1998
IEEE
16 years 5 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan