Sciweavers

7015 search results - page 185 / 1403
» Approximation algorithms for co-clustering
Sort
View
AAMAS
2007
Springer
16 years 13 days ago
Continuous-State Reinforcement Learning with Fuzzy Approximation
Abstract. Reinforcement learning (RL) is a widely used learning paradigm for adaptive agents. There exist several convergent and consistent RL algorithms which have been intensivel...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 7 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 7 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 7 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
UAI
1997
15 years 7 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish