Sciweavers

952 search results - page 85 / 191
» Computational complexity of stochastic programming problems
Sort
View
124
Voted
ICIP
2008
IEEE
16 years 2 months ago
Robust snake convergence based on dynamic programming
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
ICCBR
2003
Springer
15 years 5 months ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel
124
Voted
CP
1999
Springer
15 years 4 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
140
Voted
DATAMINE
2010
175views more  DATAMINE 2010»
15 years 21 days ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
BROADNETS
2006
IEEE
15 years 6 months ago
A Secure Programming Paradigm for Network Virtualization
—The central paradigm of today’s successful Internet is to keep the network core simple and move complexity towards the network end points. Unfortunately, this very paradigm li...
Ana Milanova, Sonia Fahmy, David Musser, Büle...