Sciweavers

1101 search results - page 17 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
CP
2006
Springer
15 years 1 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
JCNS
2010
103views more  JCNS 2010»
14 years 4 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
ECCV
2008
Springer
15 years 11 months ago
Pose Priors for Simultaneously Solving Alignment and Correspondence
Abstract. Estimating a camera pose given a set of 3D-object and 2Dimage feature points is a well understood problem when correspondences are given. However, when such correspondenc...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 3 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
CVPR
1998
IEEE
15 years 11 months ago
Comparing Images under Variable Illumination
We consider the problem of determining whether two images come from different objects or the same object in the same pose, but under different illumination conditions. We show tha...
David W. Jacobs, Peter N. Belhumeur, Ronen Basri