Sciweavers

5153 search results - page 965 / 1031
» Introduction to Randomized Algorithms
Sort
View
PET
2010
Springer
15 years 1 months ago
How Unique Is Your Web Browser?
We investigate the degree to which modern web browsers are subject to “device fingerprinting” via the version and configuration information that they will transmit to website...
Peter Eckersley
DSN
2007
IEEE
15 years 1 months ago
Bounding Peer-to-Peer Upload Traffic in Client Networks
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
Chun-Ying Huang, Chin-Laung Lei
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 1 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
15 years 1 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 1 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...