Sciweavers

2944 search results - page 588 / 589
» Improving Bound Propagation
Sort
View
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 4 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
DCOSS
2011
Springer
12 years 4 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
IACR
2011
155views more  IACR 2011»
12 years 4 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
ISCA
2008
IEEE
114views Hardware» more  ISCA 2008»
13 years 11 months ago
Globally-Synchronized Frames for Guaranteed Quality-of-Service in On-Chip Networks
Future chip multiprocessors (CMPs) may have hundreds to thousands of threads competing to access shared resources, and will require quality-of-service (QoS) support to improve sys...
Jae W. Lee, Man Cheuk Ng, Krste Asanovic
ICDE
2012
IEEE
237views Database» more  ICDE 2012»
11 years 7 months ago
On Discovery of Traveling Companions from Streaming Trajectories
— The advance of object tracking technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data stream. In this study, we investigate the pro...
Lu An Tang, Yu Zheng, Jing Yuan, Jiawei Han, Alice...