1133 search results - page 80 / 227 » Basics of Graph Cuts |
PR
2008
14 years 9 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
FUIN
2007
14 years 9 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
WADT
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
BMCBI
2007
14 years 9 months ago
2007
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...