4355 search results - page 37 / 871 » Increasing Kolmogorov Complexity |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
COMPGEOM
2001
ACM
14 years 9 days ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
ESANN
2008
13 years 10 months ago
2008
In this paper we have defined a novel activation function called the multi-level signum for the real and complex valued associative memories. The major motivation of such a functio...
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
DCT-based CODECs such as MPEG-4 Visual and H.263 "skip" many macroblocks during encoding of typical video sequences (i.e. no coded data is transmitted for these macroblo...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...