6251 search results - page 95 / 1251 » Randomness, Computability, and Density |
CIE
2009
Springer
14 years 4 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
IPPS
1996
IEEE
14 years 2 months ago
1996
IEEE
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...
ICANN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
SC
2005
ACM
14 years 3 months ago
2005
ACM
For decades, the high-performance computing (HPC) community has focused on performance, where performance is defined as speed. To achieve better performance per compute node, mic...
ICCV
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...