4112 search results - page 60 / 823 » Efficient Algorithms for the Spoonerism Problem |
137
click to vote
CONPAR
1992
15 years 8 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
ALGORITHMICA
2010
15 years 4 months ago
2010
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
124
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
135
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
115
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m