648 search results - page 14 / 130 » Lowness for Demuth Randomness |
APAL
2010
14 years 9 months ago
2010
A real x is 1 1-Kurtz random (1 1-Kurtz random) if it is in no closed null 1 1 set (1 1 set). We show that there is a cone of 1 1-Kurtz random hyperdegrees. We characterize lowness...
ICIP
2005
IEEE
15 years 3 months ago
2005
IEEE
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
COCO
2009
Springer
15 years 1 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
MEDIAFORENSICS
2010
14 years 11 months ago
2010
In this paper, we consider a low complexity identification system for highly distorted images. The performance of the proposed identification system is analyzed based on the avera...
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
—The application of adaptive techniques for obtaining bispectrum estimates in additive Gaussian noise and random shifts of received signals is considered. An approach using joint...