251 search results - page 5 / 51 » Constructive Linear Time Algorithms for Branchwidth |
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
101
click to vote
JMLR
2010
14 years 4 months ago
2010
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
NAACL
2010
14 years 7 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
STOC
1995
ACM
15 years 29 days ago
1995
ACM
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...