87 search results - page 5 / 18 » focs 2008 |
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...