7015 search results - page 284 / 1403 » Approximation algorithms for co-clustering |
146
click to vote
MOC
2002
15 years 6 months ago
2002
The authors study the Hilbert Transform on the real line. They introduce some polynomial approximations and some algorithms for its numerical evaluation. Error estimates in uniform...
156
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
156
click to vote
ICRA
2006
IEEE
16 years 20 days ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
152
click to vote
DAM
2006
15 years 6 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
173
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...