120 search results - page 11 / 24 » Random Variate Generation in One Line of Code |
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Distributed coding of correlated grayscale stereo images is effectively addressed by a recently proposed codec that learns block-wise disparity at the decoder. Based on the Slepia...
AOSD
2008
ACM
14 years 11 months ago
2008
ACM
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
70
Voted
TIT
2002
14 years 9 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
COCO
2003
Springer
15 years 2 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
56
Voted
CIC
2006
14 years 11 months ago
2006
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...