518 search results - page 64 / 104 » Object correspondence as a machine learning problem |
103
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
106
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
145
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
120
click to vote
EUROCAST
2007
Springer
15 years 8 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
107
click to vote
IOR
2002
15 years 1 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...