3257 search results - page 238 / 652 » Some Results on Effective Randomness |
CACM
2008
14 years 11 months ago
2008
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
107
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
ESA
2009
Springer
15 years 5 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
85
Voted
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
98
Voted
EUROCRYPT
2010
Springer
15 years 3 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...