4114 search results - page 68 / 823 » Efficient Algorithms for the 2-Center Problems |
151
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
100
click to vote
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...
127
click to vote
PKDD
2010
Springer
15 years 2 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...
140
click to vote
IFIP
2004
Springer
15 years 10 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...
118
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