Sciweavers

258 search results - page 25 / 52
» A General Model for Online Probabilistic Plan Recognition
Sort
View
COLT
1994
Springer
13 years 11 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
WWW
2010
ACM
14 years 2 months ago
Equip tourists with knowledge mined from travelogues
With the prosperity of tourism and Web 2.0 technologies, more and more people have willingness to share their travel experiences on the Web (e.g., weblogs, forums, or Web 2.0 comm...
Qiang Hao, Rui Cai, Changhu Wang, Rong Xiao, Jiang...
COLT
2006
Springer
13 years 11 months ago
A Randomized Online Learning Algorithm for Better Variance Control
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
Jean-Yves Audibert
WWW
2007
ACM
14 years 8 months ago
Google news personalization: scalable online collaborative filtering
Several approaches to collaborative filtering have been studied but seldom have studies been reported for large (several million users and items) and dynamic (the underlying item ...
Abhinandan Das, Mayur Datar, Ashutosh Garg, ShyamS...
IROS
2008
IEEE
138views Robotics» more  IROS 2008»
14 years 2 months ago
Blended local planning for generating safe and feasible paths
Abstract— Many planning approaches adhere to the twotiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. W...
Ling Xu, Anthony Stentz