4843 search results - page 841 / 969 » The Shortcut Problem - Complexity and Approximation |
126
click to vote
FGR
2004
IEEE
15 years 6 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...
131
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
117
click to vote
FQAS
2006
Springer
15 years 6 months ago
2006
Springer
Searchers' difficulty in formulating effective queries for their information needs is well known. Analysis of search session logs shows that users often pose short, vague quer...
123
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
144
Voted
GECCO
2006
Springer
15 years 6 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...