2084 search results - page 195 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
125
Voted
DAM
2007
15 years 2 months ago
2007
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
116
click to vote
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
140
Voted
DAC
2006
ACM
16 years 3 months ago
2006
ACM
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
143
Voted
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
125
click to vote
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...