6251 search results - page 114 / 1251 » Randomness, Computability, and Density |
84
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
117
click to vote
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Power density and heat density of multicore processor system are increasing exponentially with Moore's Law. High temperature on chip greatly affects its reliability,...
91
Voted
ECCC
2010
15 years 23 days ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
92
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
AAECC
2002
Springer
15 years 17 days ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...