Sciweavers

291 search results - page 25 / 59
» The Bidimensionality Theory and Its Algorithmic Applications
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
CORR
2006
Springer
148views Education» more  CORR 2006»
13 years 8 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 7 months ago
Reinforcement learning of motor skills in high dimensions: A path integral approach
— Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far d...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 3 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
COMPGEOM
2010
ACM
14 years 1 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang