7930 search results - page 82 / 1586 » Greedy in Approximation Algorithms |
158
click to vote
COCO
2009
Springer
16 years 22 days ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
155
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
164
click to vote
QEST
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
152
click to vote
CISS
2008
IEEE
16 years 19 days ago
2008
IEEE
Abstract—We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless ch...
173
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...