4009 search results - page 415 / 802 » Clustering on Complex Graphs |
368
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...
130
click to vote
STOC
2005
ACM
16 years 7 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...
196
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
154
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
229
click to vote
BIBE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In order to simulate biological processes, we use multi-agents system. However, modelling cell behavior in systems biology is complex and may be based on intracellular biochemic...