2612 search results - page 249 / 523 » Switching Graphs and Their Complexity |
119
click to vote
STOC
2005
ACM
16 years 6 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...
176
click to vote
ICCAD
2003
IEEE
16 years 2 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...
143
click to vote
ICCAD
2001
IEEE
16 years 2 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. ...
210
click to vote
BIBE
2009
IEEE
16 years 22 days 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...
185
click to vote
PKDD
2009
Springer
16 years 13 days ago
2009
Springer
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...