Sciweavers

Share
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
9 years 17 days ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
ATAL
2005
Springer
9 years 4 months ago
Modeling task allocation using a decision theoretic model
Mediation is the process of decomposing a task into subtasks, ļ¬nding agents suitable for these subtasks and negotiating with agents to obtain commitments to execute these subtas...
Sherief Abdallah, Victor R. Lesser
ECCV
2004
Springer
10 years 1 months ago
Decision Theoretic Modeling of Human Facial Displays
We present a vision based, adaptive, decision theoretic model of human facial displays in interactions. The model is a partially observable Markov decision process, or POMDP. A POM...
Jesse Hoey, James J. Little
books