Sciweavers

Share
16 search results - page 3 / 4
» The descent set polynomial revisited
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
9 years 1 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
APPROX
2015
Springer
29views Algorithms» more  APPROX 2015»
3 years 3 months ago
Fully Dynamic Bin Packing Revisited
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, ...
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
FOCS
2006
IEEE
9 years 1 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
NIPS
2008
8 years 8 months ago
Bayesian Kernel Shaping for Learning Control
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
Jo-Anne Ting, Mrinal Kalakrishnan, Sethu Vijayakum...
CORR
2010
Springer
190views Education» more  CORR 2010»
8 years 7 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
books