316 search results - page 42 / 64 » On Approximate Majority and Probabilistic Time |
99
Voted
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an extensive statistical study and analysis of the effects of channel delays in the current (best-effort) Internet on underflow events in MPEG-4 video streamin...
114
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
COCO
2005
Springer
14 years 11 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
83
Voted
CHES
2006
Springer
15 years 1 months ago
2006
Springer
Side-channel attacks are a serious threat to implementations of cryptographic algorithms. Secret information is recovered based on power consumption, electromagnetic emanations or ...
150
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...