2125 search results - page 155 / 425 » On Graph Complexity |
OTM
2007
Springer
15 years 4 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
ICIP
2005
IEEE
15 years 3 months 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 ...
GG
2004
Springer
15 years 3 months 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...
IPPS
1999
IEEE
15 years 2 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,...
69
Voted
ISCAPDCS
2007
14 years 11 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...