119 search results - page 18 / 24 » stoc 2010 |
101
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
150
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
123
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
120
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
141
Voted
SIAMDM
2010
14 years 10 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...