Sciweavers

1369 search results - page 234 / 274
» Lattice computations for random numbers
Sort
View
PODC
2011
ACM
12 years 11 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
WWW
2005
ACM
14 years 9 months ago
A search engine for natural language applications
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
Michael J. Cafarella, Oren Etzioni
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
14 years 9 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 9 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
MOBIHOC
2001
ACM
14 years 8 months ago
Performance of a new Bluetooth scatternet formation protocol
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...
Ching Law, Amar K. Mehta, Kai-Yeung Siu