648 search results - page 17 / 130 » Lowness for Demuth Randomness |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
WADS
2009
Springer
15 years 4 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
114
click to vote
ATS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract—This paper presents a low transition test pattern generator, called LT-LFSR, to reduce average and peak power of a circuit during test by reducing the transitions within...
WIOPT
2010
IEEE
14 years 8 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...