Sciweavers

317 search results - page 12 / 64
» Computing and Updating the Process Number in Trees
Sort
View
90
Voted
ICIP
2007
IEEE
15 years 6 months ago
Dual-Layer Visual Vocabulary Tree Hypotheses for Object Recognition
This paper introduces an efficient method to substantially increase the recognition performance of a vocabulary tree based recognition system. We propose to enhance the hypothesi...
Sandra Ober, Martin Winter, Clemens Arth, Horst Bi...
101
Voted
JCB
2006
115views more  JCB 2006»
14 years 11 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
114
Voted
EACL
2006
ACL Anthology
15 years 1 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
IS
2006
14 years 11 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
93
Voted
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
15 years 6 months ago
Dynamic Metadata Management for Scalable Stream Processing Systems
Adaptive query processing is of utmost importance for the scalability of data stream processing systems due to the long-running queries and fluctuating stream characteristics. An...
Michael Cammert, Jürgen Krämer, Bernhard...