685 search results - page 19 / 137 » Succinct Trees in Practice |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
VLDB
1992
ACM
13 years 11 months ago
1992
ACM
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
ACTA
2010
13 years 7 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
ACL
1996
13 years 8 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
WABI
2004
Springer
14 years 26 days ago
2004
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...