Sciweavers

840 search results - page 81 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
DCOSS
2006
Springer
15 years 4 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
97
Voted
ECCV
2002
Springer
16 years 2 months ago
Maximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
João Costeira, João Maciel
110
Voted
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 6 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
SAGA
2009
Springer
15 years 7 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
88
Voted
ICPR
2006
IEEE
16 years 1 months ago
Image Renaissance Using Discrete Optimization
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
Cédric Allène, Nikos Paragios