2354 search results - page 314 / 471 » Randomness, Stochasticity and Approximations |
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
191
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
169
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
152
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We present an on-line crosslayer control technique to characterize and approximate optimal policies for wireless networks. Our approach combines network utility maximization and ad...
172
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...