Search Sciweavers | Sciweavers

14

ICML
2005
IEEE

135views Machine Learning» more ICML 2005»

Finite time bounds for sampling based fitted value iteration

14 years 6 months ago

In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...

Csaba Szepesvári, Rémi Munos

claim paper

Read More »

13

click to vote

COMPGEOM
2006
ACM

99views Discrete Geometry» more COMPGEOM 2006»

Iterated snap rounding with bounded drift

14 years 16 hour ago

Download cccg.ca

Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a ﬁxed-precision representation. In the previous years two variant...

Eli Packer

claim paper

Read More »

16

click to vote

AAAI
2006

157views Intelligent Agents» more AAAI 2006»

Compact, Convex Upper Bound Iteration for Approximate POMDP Planning

13 years 7 months ago

Download www.aaai.org

Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...

Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...

claim paper

Read More »

18

click to vote

COMPGEOM
2009
ACM

100views Discrete Geometry» more COMPGEOM 2009»

k-means requires exponentially many iterations even in the plane

13 years 10 months ago

Download cseweb.ucsd.edu

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....

Andrea Vattani

claim paper

Read More »

8

click to vote

ICPR
2006
IEEE

121views computer vision» more ICPR 2006»

Iterative Error Bound Minimisation for AAM Alignment

14 years 7 months ago

Download users.rsise.anu.edu.au

Jason Saragih, Roland Göcke

claim paper