666 search results - page 104 / 134 » Unbalanced Graph Cuts |
103
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
113
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
98
Voted
JMIV
2006
15 years 20 days ago
2006
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
76
Voted
AML
2005
15 years 19 days ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
103
click to vote
TKDE
2008
15 years 18 days ago
2008
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...