7129 search results - page 1082 / 1426 » Approximation Algorithms for Treewidth |
163
click to vote
SIPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Low-density parity-check (LDPC) codes on par with convolutional turbo codes (CTC) are two of the most powerful error correction codes known to perform very close to the Shannon li...
164
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
146
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
157
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
137
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...