209 search results - page 20 / 42 » The Computational Complexity of Weak Saddles |
FOCS
2003
IEEE
14 years 24 days ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
ECCC
2007
13 years 7 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
Despite the computing power of emerging technologies, predicting long RNA secondary structures with thermodynamics-based methods is still infeasible, especially if the structures ...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...