3096 search results - page 361 / 620 » The Generalized FITC Approximation |
167
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
161
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
Bayesian MLP neural networks are a flexible tool in complex nonlinear problems. The approach is complicated by need to evaluate integrals over high-dimensional probability distri...
147
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
179
click to vote
DGCI
1999
Springer
15 years 10 months ago
1999
Springer
Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techn...
227
click to vote
ICCVW
1999
Springer
15 years 10 months ago
1999
Springer
This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the p...