119 search results - page 12 / 24 » Bounds on Codes Based on Graph Theory |
SCOPES
2004
Springer
14 years 13 days ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
APN
2007
Springer
14 years 1 months ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
APN
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
ET
2010
13 years 5 months ago
2010
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
WDAG
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...