Sciweavers

1483 search results - page 191 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
ICPR
2008
IEEE
15 years 7 months ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang
JSAT
2006
134views more  JSAT 2006»
15 years 1 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
SMA
2008
ACM
150views Solid Modeling» more  SMA 2008»
15 years 1 months ago
Surface matching using consistent pants decomposition
Surface matching is fundamental to shape computing and various downstream applications. This paper develops a powerful pants decomposition framework for computing maps between sur...
Xin Li, Xianfeng Gu, Hong Qin
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 5 months ago
Epsilon-constraint with an efficient cultured differential evolution
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
Ricardo Landa Becerra, Carlos A. Coello Coello
NIPS
2003
15 years 2 months ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek