Sciweavers

3044 search results - page 208 / 609
» Linear logical approximations
Sort
View
122
Voted
FOCS
2010
IEEE
15 years 1 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
150
Voted
TCAD
2010
107views more  TCAD 2010»
14 years 10 months ago
Evaluating Statistical Power Optimization
In response to the increasing variations in integrated-circuit manufacturing, the current trend is to create designs that take these variations into account statistically. In this ...
Jason Cong, Puneet Gupta, John Lee
142
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
150
Voted
CAGD
2011
14 years 7 months ago
Generalized shape operators on polyhedral surfaces
This work concerns the approximation of the shape operator of smooth surfaces in R3 from polyhedral surfaces. We introduce two generalized shape operators that are vector-valued l...
Klaus Hildebrandt, Konrad Polthier
123
Voted
FOCS
2008
IEEE
15 years 10 months ago
Linear Level Lasserre Lower Bounds for Certain k-CSPs
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
Grant Schoenebeck