Sciweavers

2244 search results - page 358 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
EVOW
2006
Springer
15 years 10 months ago
Associative Memory Scheme for Genetic Algorithms in Dynamic Environments
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
Shengxiang Yang
CP
2008
Springer
15 years 8 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 10 months ago
Gigapixel Binary Sensing: Image Acquisition Using Oversampled One-Bit Poisson Statistics
We study a new gigapixel image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measur...
Feng Yang, Yue M. Lu, Luciano Sbaiz, Martin Vetter...
CVPR
2009
IEEE
17 years 1 months ago
Max-Margin Hidden Conditional Random Fields for Human Action Recognition
We present a new method for classification with structured latent variables. Our model is formulated using the max-margin formalism in the discriminative learning literature. We...
Yang Wang 0003, Greg Mori
ICIP
1997
IEEE
16 years 7 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin