71 search results - page 2 / 15 » Compressing Large Signature Trees |
IACR
2011
12 years 4 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
ISBRA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
EMNLP
2007
13 years 6 months ago
2007
This paper presents a tree-to-tree transduction method for text rewriting. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of...
DCC
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
WACV
2012
IEEE
12 years 25 days ago
2012
IEEE
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...