Sciweavers

886 search results - page 8 / 178
» On the Autoreducibility of Random Sequences
Sort
View
IJNSEC
2010
98views more  IJNSEC 2010»
13 years 2 months ago
A Random Bit Generator Using Chaotic Maps
Chaotic systems have many interesting features such as sensitivity on initial condition and system parameter, ergodicity and mixing properties. In this paper, we exploit these int...
Narendra K. Pareek, Vinod Patidar, Krishan K. Sud
RSA
2010
108views more  RSA 2010»
13 years 6 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
SIAMSC
2010
130views more  SIAMSC 2010»
13 years 2 months ago
Quasi-Monte Carlo Method for Infinitely Divisible Random Vectors via Series Representations
Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been inves...
Junichi Imai, Reiichiro Kawai
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 6 months ago
Feature Construction for Relational Sequence Learning
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...