A discrete theory of search. I
Page 1 Next
Igor Vajda (1971)
Aplikace matematiky
Igor Vajda (1971)
Aplikace matematiky
Baig, M.A.K., Dar, Javid Gani (2009)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Annaby, Mahmoud H., Hassan, Hassan A. (1998)
International Journal of Mathematics and Mathematical Sciences
Igor Vajda (1987)
Kybernetika
Kwabena Doku-Amponsah (2012)
ESAIM: Probability and Statistics
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...
Kwabena Doku-Amponsah (2012)
ESAIM: Probability and Statistics
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...
Štefan Šujan (1981)
Kybernetika
Dar, Rayees Ahmad, Baig, M.A.K. (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Štefan Šujan (1981)
Kybernetika
Brian Marcus, Selim Tuncel (1990)
Inventiones mathematicae
Štefan Šujan (1980)
Kybernetika
P.N. Rathie (1972)
Metrika
Asha Garg (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Riis, Søren (2007)
The Electronic Journal of Combinatorics [electronic only]
Priti Jain, R. K. Tuteja (1987)
Kybernetika
Prasanna K. Sahoo (1986)
Kybernetika
Lóránt Farkas, Tamás Kói (2014)
Kybernetika
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
Jain, Priti, Tuteja, R.K. (1989)
International Journal of Mathematics and Mathematical Sciences
Edel, Yves, Rains, E.M., Sloane, N.J.A. (1998)
The Electronic Journal of Combinatorics [electronic only]
Page 1 Next