4865 search results - page 428 / 973 » The Complexity of Graph Connectivity |
158
click to vote
ICIP
2005
IEEE
16 years 14 days ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
169
Voted
GG
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Development processes in engineering disciplines are inherently complex. Throughout the development process, different kinds of inter-dependent design documents are creat...
166
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
197
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper a new approach is presented to build a list of faults to be used by the fault injection environment; the list is built starting from a high-level description of the ...
179
Voted
ICWS
2007
IEEE
15 years 8 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...