FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

We present a polynomial time algorithm based on semideﬁnite programming that, given a unique game of value 1 − O(1/ log n), satisﬁes a constant fraction of constraints, wher...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

We consider the problem of storing a large ﬁle on a remote and unreliable server. To verify that the ﬁle has not been corrupted, a user could store a small private (randomized...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...

FOCS

2005

IEEE

13 years 12 months ago
2005

IEEE

In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to ﬁnd a string s of length L such that each string si has a consecutive substring of length L ...