Sciweavers

1511 search results - page 40 / 303
» Randomness, lowness and degrees
Sort
View
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
15 years 5 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
PODC
2003
ACM
15 years 5 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
ASMTA
2009
Springer
92views Mathematics» more  ASMTA 2009»
15 years 3 months ago
Comparison of Multi-service Routing Strategies for IP Core Networks
Abstract. Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when ...
Ulf Jensen, Armin Heindl
CORR
2008
Springer
90views Education» more  CORR 2008»
14 years 12 months ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen
RSA
2011
126views more  RSA 2011»
14 years 6 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...