2473 search results - page 194 / 495 » The Logic of Communication Graphs |
119
Voted
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
251
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
130
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
120
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
158
click to vote
IRI
2003
IEEE
15 years 9 months ago
2003
IEEE
- Middleware technologies change so rapidly that designers must adapt existing software architectures to incorporate new emerging ones. This paper proposes tectural pattern and gui...