685 search results - page 6 / 137 » Succinct Trees in Practice |
185
Voted
DCC
2011
IEEE
14 years 10 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
117
click to vote
ICDCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We model the overlay using linear capacity constraints, which accurately and succinctly capture overlay link correlations. We show that finding a maximum-bandwidth multicast tree...
100
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
126
click to vote
ISPD
2000
ACM
15 years 7 months ago
2000
ACM
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
136
Voted
JCSS
2007
15 years 3 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...