666 search results - page 15 / 134 » Unbalanced Graph Cuts |
88
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
96
Voted
WADS
1993
Springer
15 years 6 months ago
1993
Springer
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
110
Voted
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
131
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
135
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...