Sciweavers

1133 search results - page 56 / 227
» Best Practices in e-Assessment
Sort
View
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
14 years 6 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...
DAC
2011
ACM
14 years 6 months ago
Fault-tolerant 3D clock network
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
Chiao-Ling Lung, Yu-Shih Su, Shih-Hsiu Huang, Yiyu...
IACR
2011
155views more  IACR 2011»
14 years 6 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...
VLDB
2001
ACM
151views Database» more  VLDB 2001»
16 years 6 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
WIKIS
2006
ACM
16 years 7 days ago
Constrained Wiki: an Oxymoron?
In this paper we propose a new wiki concept — light constraints — designed to encode community best practices and domain-specific requirements, and to assist in their applica...
Angelo Di Iorio, Stefano Zacchiroli