Sciweavers

81 search results - page 14 / 17
» iv 2009
Sort
View
EUROCRYPT
2009
Springer
15 years 10 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
MOBIHOC
2009
ACM
15 years 10 months ago
Experimental characterization of sectorized antennas in dense 802.11 wireless mesh networks
Sectorized antennas can increase wireless network capacity through greater spatial reuse. Despite their increasing popularity, their real-world performance characteristics in dens...
Anand Prabhu Subramanian, Henrik Lundgren, Theodor...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
15 years 9 months ago
Automated SQL tuning through trial and (sometimes) error
SQL tuning--the attempt to improve a poorly-performing execution plan produced by the database query optimizer-is a critical aspect of database performance tuning. Ironically, as ...
Herodotos Herodotou, Shivnath Babu
SIGMOD
2009
ACM
130views Database» more  SIGMOD 2009»
15 years 9 months ago
FlashLogging: exploiting flash devices for synchronous logging performance
Synchronous transactional logging is the central mechanism for ensuring data persistency and recoverability in database systems. Unfortunately, magnetic disks are ill-suited for t...
Shimin Chen
SPAA
2009
ACM
15 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald