Sciweavers

7758 search results - page 88 / 1552
» On the Number of Distributive Lattices
Sort
View
ASIACRYPT
2011
Springer
12 years 10 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
GLOBECOM
2007
IEEE
14 years 4 months ago
Priority Collision Resolution - Distributed Coordination Function for Distributed Wireless Networks
— In distributed wireless access networks, the short-term unfairness of IEEE 802.11 Distributed Coordination Function (DCF) has been revealed by many works. In this paper, a modi...
Xiaohui Ye, Xin Liu, S. J. Ben Yoo, Zhi Ding
SIAMCOMP
2010
105views more  SIAMCOMP 2010»
13 years 4 months ago
Fast Access to Distributed Atomic Memory
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Marko...
JC
2008
90views more  JC 2008»
13 years 10 months ago
On the probability distribution of data at points in real complete intersection varieties
We show several estimates on the probability distribution of some data at points in real complete intersection varieties: norms of real affine solutions, condition number of real ...
Cruz E. Borges, Luis M. Pardo
IPPS
2007
IEEE
14 years 4 months ago
Domain Decomposition vs. Master-Slave in Apparently Homogeneous Systems
This paper investigates the utilization of the master-slave (MS) paradigm as an alternative to domain decomposition (DD) methods for parallelizing lattice gauge theory (LGT) model...
Cyril Banino-Rokkones