Sciweavers

778 search results - page 69 / 156
» Bounding Smooth Integers
Sort
View
FOCS
2010
IEEE
13 years 5 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
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 2 months ago
A Unifying View of Multiple Kernel Learning
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
Marius Kloft, Ulrich Rückert, Peter L. Bartle...
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
14 years 8 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
MFCS
2010
Springer
13 years 5 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
14 years 8 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu