219 search results - page 2 / 44 » Fast Algorithms for Finding Extremal Sets |
AAAI
2010
13 years 6 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
ICML
2003
IEEE
14 years 5 months ago
2003
IEEE
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
DSD
2004
IEEE
13 years 8 months ago
2004
IEEE
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...