Sciweavers

111 search results - page 18 / 23
» The Complexity of Local List Decoding
Sort
View
ASAP
2008
IEEE
120views Hardware» more  ASAP 2008»
15 years 8 days ago
Lightweight DMA management mechanisms for multiprocessors on FPGA
This paper presents a multiprocessor system on FPGA that adopts Direct Memory Access (DMA) mechanisms to move data between the external memory and the local memory of each process...
Antonino Tumeo, Matteo Monchiero, Gianluca Palermo...
95
Voted
FOCS
2000
IEEE
15 years 2 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
72
Voted
ACIVS
2006
Springer
15 years 4 months ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...
88
Voted
SPAA
2005
ACM
15 years 3 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
105
Voted
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
13 years 10 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin