3875 search results - page 699 / 775 » Approximation algorithms for the 0-extension problem |
ECML
1993
Springer
15 years 1 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
112
click to vote
ATAL
2007
Springer
15 years 1 months ago
2007
Springer
Models of agent-environment interaction that use predictive state representations (PSRs) have mainly focused on the case of discrete observations and actions. The theory of discre...
CLUSTER
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
We consider the problem of robustly and accurately locating facial features. The relative positions of different feature points are represented using a statistical shape model. We...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...