7150 search results - page 1293 / 1430 » An Approximation Algorithm for Approximation Rank |
188
click to vote
SIPS
2008
IEEE
16 years 21 days 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...
194
click to vote
IPSN
2007
Springer
16 years 14 days 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...
188
click to vote
BIBE
2005
IEEE
15 years 12 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 ...
170
click to vote
WDAG
2009
Springer
15 years 11 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...
143
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...