Sciweavers

260 search results - page 16 / 52
» Data-Layout Optimization Using Reuse Distance Distribution
Sort
View
IJHPCN
2008
94views more  IJHPCN 2008»
14 years 10 months ago
Analysing and improving clustering based sampling for microprocessor simulation
: We propose a set of statistical metrics for making a comprehensive, fair, and insightful evaluation of features, clustering algorithms, and distance measures in representative sa...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
IPPS
2009
IEEE
15 years 4 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
MOBIHOC
2006
ACM
15 years 9 months ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong
ISPD
2012
ACM
248views Hardware» more  ISPD 2012»
13 years 5 months ago
A fast estimation of SRAM failure rate using probability collectives
Importance sampling is a popular approach to estimate rare event failures of SRAM cells. We propose to improve importance sampling by probability collectives. First, we use “Kul...
Fang Gong, Sina Basir-Kazeruni, Lara Dolecek, Lei ...
CRYPTO
2005
Springer
107views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
A Quantum Cipher with Near Optimal Key-Recycling
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...
Ivan Damgård, Thomas Brochmann Pedersen 0002...