1115 search results - page 62 / 223 » Active Graph Cuts |
106
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
105
click to vote
STOC
1999
ACM
15 years 6 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...
113
click to vote
COMBINATORICA
2004
15 years 2 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
124
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
140
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...