848 search results - page 106 / 170 » Randomness and the linear degrees of computability |
129
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
162
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
109
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
143
click to vote
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
We introduce a novel method of test generation for microprocessors at the RTL using spectral methods. Test vectors are generated for RTL faults, which are the stuck-at faults on i...
112
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— This paper is concerned with control applications over lossy data networks. Sensor data is transmitted to an estimation-control unit over a network, and control command...