1855 search results - page 8 / 371 » A coding theorem for distributed computation |
EUROPAR
2006
Springer
14 years 2 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
DCC
2001
IEEE
14 years 10 months ago
2001
IEEE
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorith...
FATES
2003
Springer
14 years 4 months ago
2003
Springer
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
NCA
2008
IEEE
14 years 5 months ago
2008
IEEE
Distributed storage systems apply erasure-tolerant codes to guarantee reliable access to data despite failures of storage resources. While many codes can be mapped to XOR operatio...