107 search results - page 7 / 22 » Factor cuts |
72
Voted
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
STOC
1999
ACM
15 years 2 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
75
Voted
CHI
2004
ACM
15 years 10 months ago
2004
ACM
Each window on our computer desktop provides a view into some information. Although users can currently manipulate multiple windows, we assert that being able to spatially arrange...
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
99
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...