2125 search results - page 193 / 425 » On Graph Complexity |
122
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CVPR
1999
IEEE
16 years 5 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...
135
click to vote
ICCAD
2003
IEEE
15 years 12 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...
109
click to vote
ICCAD
2001
IEEE
15 years 12 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. ...
171
click to vote
BIBE
2009
IEEE
15 years 10 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...