554 search results - page 92 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
158
click to vote
ICCV
2001
IEEE
16 years 7 months ago
2001
IEEE
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
148
click to vote
INFOCOM
2007
IEEE
16 years 3 days ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
164
click to vote
IWPEC
2009
Springer
16 years 11 days ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
161
click to vote
CP
1995
Springer
15 years 9 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
184
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...