Sciweavers

144 search results - page 24 / 29
» Sampling Techniques for Large, Dynamic Graphs
Sort
View
76
Voted
SARA
2007
Springer
15 years 3 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
ACII
2011
Springer
13 years 9 months ago
A Psychologically-Inspired Match-Score Fusion Model for Video-Based Facial Expression Recognition
Communication between humans is rich in complexity and is not limited to verbal signals; emotions are conveyed with gesture, pose and facial expression. Facial Emotion Recognition ...
Albert Cruz, Bir Bhanu, Songfan Yang
CGF
2008
151views more  CGF 2008»
14 years 9 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
IUI
2009
ACM
15 years 6 months ago
Structuring and manipulating hand-drawn concept maps
Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map cr...
Yingying Jiang, Feng Tian, XuGang Wang, Xiaolong Z...
JMLR
2008
129views more  JMLR 2008»
14 years 9 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári