7930 search results - page 318 / 1586 » Greedy in Approximation Algorithms |
197
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
187
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
164
click to vote
ECCC
2000
15 years 6 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
168
Voted
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
193
click to vote
AAIM
2006
Springer
16 years 19 days ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...