Sciweavers

621 search results - page 5 / 125
» Parsing As Tree Traversal
Sort
View
COLING
2010
14 years 11 months ago
Dependency-driven Anaphoricity Determination for Coreference Resolution
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel-based anaphoricity determination in coreference resoluti...
Fang Kong, Guodong Zhou, Longhua Qian, Qiaoming Zh...
ACMSE
2006
ACM
15 years 10 months ago
Framework design using function generalization: a binary tree traversal case study
A software framework is a technology that enables software reuse, potentially yielding rich dividends but requiring significant longterm investment. However, a framework is not a ...
H. Conrad Cunningham, Yi Liu, Pallavi Tadepalli
EUROCRYPT
2004
Springer
15 years 9 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
CTRSA
2003
Springer
114views Cryptology» more  CTRSA 2003»
15 years 9 months ago
Fractal Merkle Tree Representation and Traversal
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
Markus Jakobsson, Frank Thomson Leighton, Silvio M...
ICPADS
2005
IEEE
15 years 10 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan