Sciweavers

1538 search results - page 223 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
HOTNETS
2010
14 years 8 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
PLILP
1998
Springer
15 years 5 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
AHS
2006
IEEE
188views Hardware» more  AHS 2006»
15 years 5 months ago
Finite State Machine IP Watermarking: A Tutorial
Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...
Amr T. Abdel-Hamid, Sofiène Tahar, El Mosta...
CASES
2004
ACM
15 years 5 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
ASPDAC
2009
ACM
113views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Post-routing redundant via insertion with wire spreading capability
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...
Cheok-Kei Lei, Po-Yi Chiang, Yu-Min Lee