Sciweavers

509 search results - page 48 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
CVPR
2009
IEEE
16 years 9 months ago
Robust Multi-Class Transductive Learning with Graphs
Graph-based methods form a main category of semisupervised learning, offering flexibility and easy implementation in many applications. However, the performance of these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...
ECML
2007
Springer
15 years 8 months ago
Policy Gradient Critics
We present Policy Gradient Actor-Critic (PGAC), a new model-free Reinforcement Learning (RL) method for creating limited-memory stochastic policies for Partially Observable Markov ...
Daan Wierstra, Jürgen Schmidhuber
IJCAI
1989
15 years 3 months ago
Coping With Uncertainty in Map Learning
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...
Kenneth Basye, Thomas Dean, Jeffrey Scott Vitter
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
16 years 3 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu
ICALP
2001
Springer
15 years 7 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan