Sciweavers

144 search results - page 26 / 29
» The Cost of Learning Directed Cuts
Sort
View
COLT
1999
Springer
13 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
WEBNET
2001
13 years 8 months ago
Electronically Assisting Communication for Health Professionals
: New information and computing technologies offer cost efficient and effective learning opportunities for health care professionals. The Assisted Electronic Communication project ...
Peter Scott, Fiona Brooks, Kevin Quick, Maria Maci...
CRV
2008
IEEE
295views Robotics» more  CRV 2008»
14 years 1 months ago
3D Human Motion Tracking Using Dynamic Probabilistic Latent Semantic Analysis
We propose a generative statistical approach to human motion modeling and tracking that utilizes probabilistic latent semantic (PLSA) models to describe the mapping of image featu...
Kooksang Moon, Vladimir Pavlovic
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
14 years 1 months ago
Paired Learners for Concept Drift
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
Stephen H. Bach, Marcus A. Maloof
MICRO
2003
IEEE
70views Hardware» more  MICRO 2003»
14 years 19 days ago
Fast Path-Based Neural Branch Prediction
Microarchitectural prediction based on neural learning has received increasing attention in recent years. However, neural prediction remains impractical because its superior accur...
Daniel A. Jiménez