Sciweavers

1949 search results - page 208 / 390
» Random graphs on surfaces
Sort
View
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
15 years 3 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
CORR
2010
Springer
179views Education» more  CORR 2010»
15 years 2 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 days ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
SAC
2010
ACM
15 years 12 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 11 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan