Sciweavers

1927 search results - page 296 / 386
» UMDAs for dynamic optimization problems
Sort
View
EMMCVPR
2007
Springer
15 years 4 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
ECOOPW
2006
Springer
15 years 4 months ago
Program Analysis for Security and Privacy
Abstract. Software security has become more important than ever. Unfortunately, still now, the security of a software system is almost always retrofitted to an afterthought. When s...
Marco Pistoia, Francesco Logozzo
FLAIRS
2008
15 years 3 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 2 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
97
Voted
AMCS
2010
146views Mathematics» more  AMCS 2010»
15 years 25 days ago
Sensor network design for the estimation of spatially distributed processes
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
Dariusz Ucinski, Maciej Patan