209 search results - page 23 / 42 » The Computational Complexity of Weak Saddles |
DAM
2006
15 years 1 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
112
click to vote
TEC
2008
15 years 1 months ago
2008
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
103
click to vote
ICIP
2010
IEEE
14 years 11 months ago
2010
IEEE
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
107
click to vote
CIMAGING
2009
14 years 11 months ago
2009
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
115
click to vote
TSP
2010
14 years 8 months ago
2010
[1, 2] have shown for the dynamic spectrum allocation problem that a competitive market model (which sets a price for transmission power on each channel) leads to a greater social...