Sciweavers

1393 search results - page 222 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2008
IEEE
16 years 20 days ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICML
2006
IEEE
16 years 20 days ago
Algorithms for portfolio management based on the Newton method
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. S...
ICML
2006
IEEE
16 years 20 days ago
Personalized handwriting recognition via biased regularization
We present a new approach to personalized handwriting recognition. The problem, also known as writer adaptation, consists of converting a generic (user-independent) recognizer int...
Wolf Kienzle, Kumar Chellapilla
83
Voted
ICML
2006
IEEE
16 years 20 days ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
ICML
2006
IEEE
16 years 20 days ago
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
Marc Toussaint, Amos J. Storkey