Sciweavers

3600 search results - page 587 / 720
» The settling-time reducibility ordering
Sort
View
JETC
2008
127views more  JETC 2008»
15 years 5 months ago
Automated module assignment in stacked-Vdd designs for high-efficiency power delivery
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
Yong Zhan, Sachin S. Sapatnekar
PVLDB
2010
118views more  PVLDB 2010»
15 years 4 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
ASIACRYPT
2010
Springer
15 years 4 months ago
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
Abstract. AES is the most widely used block cipher today, and its security is one of the most important issues in cryptanalysis. After 13 years of analysis, related-key attacks wer...
Orr Dunkelman, Nathan Keller, Adi Shamir
ISW
2010
Springer
15 years 4 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
NOMS
2010
IEEE
201views Communications» more  NOMS 2010»
15 years 4 months ago
Checkpoint-based fault-tolerant infrastructure for virtualized service providers
Crash and omission failures are common in service providers: a disk can break down or a link can fail anytime. In addition, the probability of a node failure increases with the num...
Iñigo Goiri, Ferran Julià, Jordi Gui...