72 search results - page 8 / 15 » stoc 2003 |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...