265 search results - page 8 / 53 » Biased Normalized Cuts |
126
Voted
ACIVS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
ACL
2006
15 years 1 months ago
2006
We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes the normalized cut criterion. Our approach moves b...
103
Voted
TLCA
2005
Springer
15 years 6 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
115
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
98
Voted
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...