Sciweavers

461 search results - page 35 / 93
» Higher Kurtz randomness
Sort
View
84
Voted
ICONIP
1998
14 years 11 months ago
Statistical Methods for Construction of Neural Networks
Despite all the progress in neural networks the technology is still brittle and sometimes difficult to apply. Automatic construction of networks and proper initialization of their...
Wlodzislaw Duch, Rafal Adamczak
64
Voted
CORR
2010
Springer
68views Education» more  CORR 2010»
14 years 9 months ago
Johnson-Lindenstrauss lemma for circulant matrices
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...
Aicke Hinrichs, Jan Vybíral
62
Voted
CORR
2006
Springer
115views Education» more  CORR 2006»
14 years 9 months ago
Entropy-optimal Generalized Token Bucket Regulator
Abstract-- We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into accou...
Ashutosh Deepak Gore, Abhay Karandikar
CORR
2007
Springer
112views Education» more  CORR 2007»
14 years 9 months ago
Precoding in Multiple-Antenna Broadcast Systems with a Probabilistic Viewpoint
—In this paper, we investigate the minimum average transmit energy that can be obtained in multiple antenna broadcast systems with channel inversion technique. The achievable gai...
Amin Mobasher, Amir K. Khandani
ANOR
2005
93views more  ANOR 2005»
14 years 9 months ago
Evolutionary Approaches to DNA Sequencing with Errors
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
Jacek Blazewicz, Fred Glover, Marta Kasprzak