Sciweavers

7758 search results - page 216 / 1552
» On the Number of Distributive Lattices
Sort
View
HIP
2005
Springer
124views Cryptology» more  HIP 2005»
16 years 23 hour ago
How Much Assurance Does a PIN Provide?
Abstract. We would like to quantify the assurance contained in an authentication secret. For instance, how much assurance does a customer convey to a bank by revealing that his Per...
Jon Louis Bentley, Colin Mallows
PODC
2010
ACM
15 years 6 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
ICS
1997
Tsinghua U.
15 years 10 months ago
Compiler and Run-Time Support for Semi-Structured Applications
Adaptive mesh re nement (AMR) is a very important scienti c application. Several libraries implementing speci c distribution policies havebeen written for AMR. In this paper, we p...
Nikos Chrisochoides, Induprakas Kodukula, Keshav P...
TWC
2008
109views more  TWC 2008»
15 years 6 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
16 years 6 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...