759 search results - page 114 / 152 » Optimal Graph Search with Iterated Graph Cuts |
ISCIS
2009
Springer
15 years 4 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...
118
click to vote
FOCS
1997
IEEE
15 years 1 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...