Sciweavers

305 search results - page 20 / 61
» From Sets to Bits in Coq
Sort
View
ICDCN
2011
Springer
14 years 2 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
91
Voted
VLSI
2005
Springer
15 years 4 months ago
Modeling the Traffic Effect for the Application Cores Mapping Problem onto NoCs
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
César A. M. Marcon, José Carlos S. P...
ICASSP
2011
IEEE
14 years 2 months ago
The value of redundant measurement in compressed sensing
The aim of compressed sensing is to recover attributes of sparse signals using very few measurements. Given an overall bit budget for quantization, this paper demonstrates that th...
Victoria Kostina, Marco F. Duarte, Sina Jafarpour,...
DFT
2005
IEEE
102views VLSI» more  DFT 2005»
15 years 23 days ago
Using Statistical Transformations to Improve Compression for Linear Decompressors
Linear decompressors are the dominant methodology used in commercial test data compression tools. However, they are generally not able to exploit correlations in the test data, an...
Samuel I. Ward, Chris Schattauer, Nur A. Touba
FOCS
1995
IEEE
15 years 2 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby