Sciweavers

34 search results - page 2 / 7
» Local-search Extraction of MUSes
Sort
View
CVPR
1996
IEEE
14 years 8 months ago
MUSE: Robust Surface Fitting using Unbiased Scale Estimates
Despite many successful applications of robust statistics, they have yet to be completely adapted to many computer vision problems. Range reconstruction, particularly in unstructu...
James V. Miller, Charles V. Stewart
ICASSP
2011
IEEE
12 years 10 months ago
A Bayesian marked point process for object detection. Application to muse hyperspectral data
Marked point processes have received a great attention in the recent years, for their ability to extract objects in large data sets as those obtained in biological studies or hype...
Florent Chatelain, Aude Costard, Olivier J. J. Mic...
PVM
2004
Springer
14 years 1 days ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 8 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
ICTAI
2006
IEEE
14 years 21 days ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...