5100 search results - page 434 / 1020 » The Linear Complexity of a Graph |
202
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
192
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, w...
399
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
154
click to vote
CVPR
1999
IEEE
16 years 9 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
156
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...