Sciweavers

672 search results - page 82 / 135
» Lower-stretch spanning trees
Sort
View
156
Voted
ICIP
1999
IEEE
16 years 5 months ago
A Toolbox for Interactive Segmentation Based on Nested Partitions
This paper presents a toolbox for interactive image segmentation based on a series of nested partitions of increasing coarseness. The user can navigate among the different resolut...
M. Francisca Zanoguera, Beatriz Marcotegui, Fernan...
100
Voted
ICPR
2006
IEEE
16 years 4 months ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
105
Voted
FOCS
2009
IEEE
15 years 10 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
123
Voted
WG
2007
Springer
15 years 9 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
99
Voted
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
15 years 9 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...