60 search results - page 4 / 12 » focs 2010 |
102
click to vote
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
94
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
For an n-variate degree
119
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
107
click to vote
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...