Sciweavers

2924 search results - page 363 / 585
» Lower Bounds in Distributed Computing
Sort
View
ESORICS
2004
Springer
15 years 10 months ago
Comparison Between Two Practical Mix Designs
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
Claudia Díaz, Len Sassaman, Evelyne Dewitte
CC
2007
Springer
123views System Software» more  CC 2007»
15 years 4 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 11 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
HASE
1997
IEEE
15 years 9 months ago
High-Coverage Fault Tolerance in Real-Time Systems Based on Point-to-Point Communication
: The distributed recovery block (DRB) scheme is a widely applicable approach for realizing both hardware and software fault tolerance in real-time distributed and parallel compute...
K. H. Kim, Chittur Subbaraman, Eltefaat Shokri
151
Voted
SIAMMAX
2011
111views more  SIAMMAX 2011»
14 years 11 months ago
Ergodicity Coefficients Defined by Vector Norms
Abstract. Ergodicity coefficients for stochastic matrices determine inclusion regions for subdominant eigenvalues; estimate the sensitivity of the stationary distribution to change...
Ilse C. F. Ipsen, Teresa M. Selee