Sciweavers

1538 search results - page 164 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
DATE
2010
IEEE
127views Hardware» more  DATE 2010»
15 years 9 months ago
A generalized control-flow-aware pattern recognition algorithm for behavioral synthesis
— Pattern recognition has many applications in design automation. A generalized pattern recognition algorithm is presented in this paper which can efficiently extract similar pat...
Jason Cong, Hui Huang, Wei Jiang
TCS
2008
15 years 3 months ago
Distance- k knowledge in self-stabilizing algorithms
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
113
Voted
DAC
2009
ACM
16 years 5 months ago
Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications
Power consumption of system-level on-chip communications is becoming more significant in the overall system-on-chip (SoC) power as technology scales down. In this paper, we propos...
Renshen Wang, Nan-Chi Chou, Bill Salefski, Chung-K...
134
Voted
ICML
2003
IEEE
16 years 4 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
106
Voted
WWW
2008
ACM
16 years 4 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...