Sciweavers

1591 search results - page 165 / 319
» Random lifts of graphs
Sort
View
IPPS
2007
IEEE
16 years 24 days ago
Analyzing the Scalability of Graph Algorithms on Eldorado
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
ICML
2010
IEEE
15 years 7 months ago
Learning Temporal Causal Graphs for Relational Time-Series Analysis
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
Yan Liu 0002, Alexandru Niculescu-Mizil, Aurelie C...
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
15 years 4 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
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months 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
16 years 1 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