Sciweavers

505 search results - page 55 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
ICIAR
2010
Springer
14 years 8 months ago
Adaptive Regularization Parameter for Graph Cut Segmentation
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
Sema Candemir, Yusuf Sinan Akgul
JCT
2007
133views more  JCT 2007»
14 years 9 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
AGTIVE
2007
Springer
15 years 3 months ago
Assuring Consistency of Business Process Models and Web Services Using Visual Contracts
Abstract. Business process models describe workflows by a set of actions together with their ordering. When implementing business processes within a service-oriented architecture,...
Gregor Engels, Baris Güldali, Christian Solte...
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
15 years 3 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
15 years 4 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu