Sciweavers

618 search results - page 41 / 124
» Short cycle connectivity
Sort
View
IPPS
2003
IEEE
15 years 3 months ago
Improving Speculative Thread-Level Parallelism Through Module Run-Length Prediction
Exploiting speculative thread-level parallelism across modules, e.g., methods, procedures, or functions, have shown promise. However, misspeculations and task creation overhead ar...
Fredrik Warg, Per Stenström
ASPDAC
2008
ACM
88views Hardware» more  ASPDAC 2008»
14 years 11 months ago
REWIRED - Register Write Inhibition by Resource Dedication
We propose REWIRED (REgister Write Inhibition by REsource Dedication), a technique for reducing power during high level synthesis (HLS) by selectively inhibiting the storage of fun...
Pushkar Tripathi, Rohan Jain, Srikanth Kurra, Pree...
SIROCCO
2010
14 years 11 months ago
Multipath Spanners
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
Cyril Gavoille, Quentin Godfroy, Laurent Viennot
CANS
2006
Springer
83views Cryptology» more  CANS 2006»
15 years 1 months ago
Efficient Mutual Data Authentication Using Manually Authenticated Strings
Abstract. Solutions for an easy and secure setup of a wireless connection between two devices are urgently needed for WLAN, Wireless USB, Bluetooth and similar standards for short ...
Sven Laur, Kaisa Nyberg
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 9 months ago
Double Clustering and Graph Navigability
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
Oskar Sandberg