FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
The Lemke
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
DGE can be exponential on abstract cubes Jir
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE