316 search results - page 11 / 64 » Bounded Depth Data Trees |
ACTA
2010
13 years 9 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...
TKDE
2008
13 years 9 months ago
2008
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper considers a tree-rewriting framework for modeling documents evolving through service calls. We focus on the automatic verification of properties of documents that may c...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...