Sciweavers

8825 search results - page 312 / 1765
» All for one or one for all
Sort
View
120
Voted
DCC
2008
IEEE
16 years 1 months ago
Improved versions of Tardos' fingerprinting scheme
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
Oded Blayer, Tamir Tassa
95
Voted
DCC
2008
IEEE
16 years 1 months ago
Noise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source
It was recently shown that the symmetric multiple-description (MD) quadratic rate-distortion function for memoryless Gaussian sources and two descriptions can be achieved by dithe...
Jan Østergaard, Ram Zamir, Yuval Kochman
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
15 years 11 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
99
Voted
ICS
2010
Tsinghua U.
15 years 11 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim
SDM
2009
SIAM
117views Data Mining» more  SDM 2009»
15 years 11 months ago
Spatially Cost-Sensitive Active Learning.
In active learning, one attempts to maximize classifier performance for a given number of labeled training points by allowing the active learning algorithm to choose which points...
Alexander Liu, Goo Jun, Joydeep Ghosh