Sciweavers

178 search results - page 17 / 36
» Constructing the Spanners of Graphs in Parallel
Sort
View
STOC
1990
ACM
95views Algorithms» more  STOC 1990»
13 years 11 months ago
Separators in Two and Three Dimensions
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
Gary L. Miller, William P. Thurston
SPAA
2000
ACM
13 years 12 months ago
Fault tolerant networks with small degree
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
Li Zhang
CONCUR
2006
Springer
13 years 11 months ago
Event Structure Semantics for Nominal Calculi
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
CVPR
2005
IEEE
14 years 9 months ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...
ISCA
1992
IEEE
113views Hardware» more  ISCA 1992»
13 years 11 months ago
Dynamic Dependency Analysis of Ordinary Programs
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
Todd M. Austin, Gurindar S. Sohi