Sciweavers

365 search results - page 34 / 73
» An Approach to Multiply Segmented Constraint Satisfaction Pr...
Sort
View
103
Voted
CEC
2005
IEEE
15 years 6 months ago
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
MICCAI
2004
Springer
16 years 1 months ago
Coupling Statistical Segmentation and PCA Shape Modeling
This paper presents a novel segmentation approach featuring shape constraints of multiple structures. A framework is developed combining statistical shape modeling with a maximum a...
Kilian M. Pohl, Simon K. Warfield, Ron Kikinis, W....
CP
2003
Springer
15 years 5 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
CONEXT
2010
ACM
14 years 10 months ago
NEVERMIND, the problem is already fixed: proactively detecting and troubleshooting customer DSL problems
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
Yu Jin, Nick G. Duffield, Alexandre Gerber, Patric...
105
Voted
CVPR
2010
IEEE
15 years 19 days ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...