Sciweavers

1511 search results - page 16 / 303
» Randomness, lowness and degrees
Sort
View
TIT
2010
97views Education» more  TIT 2010»
14 years 6 months ago
Why does the Kronecker model result in misleading capacity estimates?
Many recent works that study the performance of multi-input multi-output (MIMO) systems in practice assume a Kronecker model where the variances of the channel entries, upon decom...
Vasanthan Raghavan, Jayesh H. Kotecha, Akbar M. Sa...
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
15 years 6 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
BMCBI
2005
115views more  BMCBI 2005»
14 years 11 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...
IPL
2008
72views more  IPL 2008»
14 years 11 months ago
Turing degrees of reals of positive effective packing dimension
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that...
Rod Downey, Noam Greenberg
APAL
2008
62views more  APAL 2008»
14 years 12 months ago
The upward closure of a perfect thin class
There is a perfect thin 0 1 class whose upward closure in the Turing degrees has full measure (and indeed contains every 2-random degree.) Thus, in the Muchnik lattice of 0 1 class...
Rod Downey, Noam Greenberg, Joseph S. Miller