Sciweavers

455 search results - page 54 / 91
» Approximation Algorithms for Partial Covering Problems
Sort
View
JMLR
2010
145views more  JMLR 2010»
14 years 6 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
SIAMSC
2010
145views more  SIAMSC 2010»
14 years 6 months ago
An "hp" Certified Reduced Basis Method for Parametrized Elliptic Partial Differential Equations
We present a new "hp" parameter multi-domain certified reduced basis method for rapid and reliable online evaluation of functional outputs associated with parametrized el...
Jens L. Eftang, Anthony T. Patera, Einar M. R&osla...
AAAI
2006
15 years 1 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 12 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
JCSS
2008
138views more  JCSS 2008»
14 years 11 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...