648 search results - page 6 / 130 » Lowness for Demuth Randomness |
STOC
1998
ACM
15 years 1 months ago
1998
ACM
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
76
Voted
IPCO
2004
14 years 11 months ago
2004
Let P be a random 0/1-polytope in d with n(d) vertices, and denote by k(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and `n(d) k+1
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
JSYML
2008
14 years 9 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...