Zobrazeno 1 - 10
of 170
pro vyhledávání: '"Seroussi, Gadiel"'
Autor:
Capurro, Ignacio, Lecumberry, Federico, Martín, Álvaro, Ramírez, Ignacio, Rovira, Eugenio, Seroussi, Gadiel
This work proposes lossless and near-lossless compression algorithms for multi-channel biomedical signals. The algorithms are sequential and efficient, which makes them suitable for low-latency and low-power signal transmission applications. We make
Externí odkaz:
http://arxiv.org/abs/1605.04418
Publikováno v:
IEEE Trans. Info. Theory, Vol. 61, No. 3, 1277-1297, March 2015
We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a finite memory source of arbitrary order and unknown parameters, with a
Externí odkaz:
http://arxiv.org/abs/1412.2192
We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The deinterleaver has access to a sample of the resulting interleaved pro
Externí odkaz:
http://arxiv.org/abs/1108.5212
Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter $q$, $0{<}q{<}1$. By encoding pairs of symbols, it is possible to reduce the redundancy penal
Externí odkaz:
http://arxiv.org/abs/1102.2413
Autor:
Lenstra, Hendrik W., Seroussi, Gadiel
We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, $n$ players are fitted with randomly assigned colored hats. Individual players can see their te
Externí odkaz:
http://arxiv.org/abs/cs/0509045
Autor:
Seroussi, Gadiel
Publikováno v:
Algorithmica, Vol. 46, No. 3, pp. 557--565, 2006
We show that the number of $t$-ary trees with path length equal to $p$ is $\exp(h(t^{-1})t\log t \frac{p}{\log p}(1+o(1)))$, where $\entropy(x){=}{-}x\log x {-}(1{-}x)\log (1{-}x)$ is the binary entropy function. Besides its intrinsic combinatorial i
Externí odkaz:
http://arxiv.org/abs/cs/0509046
Autor:
van Dam, Wim, Seroussi, Gadiel
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction from the disc
Externí odkaz:
http://arxiv.org/abs/quant-ph/0207131
Publikováno v:
In Theoretical Computer Science 30 August 2015 595:34-45
Publikováno v:
In Theoretical Computer Science 2008 395(2):203-219
Autor:
Rivara-Espasandín, Martín, Balestrazzi, Lucía, Álvarez, Guillermo Dufort y, Ochoa, Idoia, Seroussi, Gadiel, Smircich, Pablo, Sotelo-Silveira, José, Martín, Álvaro
Publikováno v:
Bioinformatics Advances; 2022, Vol. 2 Issue 1, p1-7, 7p