1528 search results - page 124 / 306 » On Signatures for Communication Graphs |
187
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
140
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
: Handoff at the link layer 2 (L2) consists of three phases including scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time del...
142
click to vote
DATE
2010
IEEE
15 years 11 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...
321
click to vote
ASUNAM
2011
IEEE
14 years 6 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...
172
click to vote
WG
1998
Springer
15 years 10 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...