Results 31 to 40 of about 2,783,365 (285)
The number of distinct adjacent pairs in geometrically distributed words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A sequence of geometric random variables of length $n$ is a sequence of $n$ independent and identically distributed geometric random variables ($\Gamma_1, \Gamma_2, \dots, \Gamma_n$) where $\mathbb{P}(\Gamma_j=i)=pq^{i-1}$ for $1~\leq~j~\leq~n$ with $p+q=
Margaret Archibald +5 more
doaj +1 more source
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Analysis of ...
Valerie Berthe, Laurent Imbert
doaj +1 more source
Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms [PDF]
, 2008 We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A subset of nodes is selected according to some criterion. As a measure of efficiency of
Athreya +11 more
core +4 more sources
On-line extensible bin packing with unequal bin sizes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Analysis of ...
Deshi Ye, Guochuan Zhang
doaj +1 more source
Analysis of Spectrum Occupancy Using Machine Learning Algorithms [PDF]
, 2015 In this paper, we analyze the spectrum occupancy using different machine learning techniques. Both supervised techniques (naive Bayesian classifier (NBC), decision trees (DT), support vector machine (SVM), linear regression (LR)) and unsupervised ...
Azmat, Freeha +2 more
core +2 more sources
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Gregory Nuel
doaj +1 more source
Analysis of Grain’s Initialization Algorithm [PDF]
, 2008 In this paper, we analyze the initialization algorithm of Grain, one of the eSTREAM candidates which made it to the third phase of the project. We point out the existence of a sliding property in the initialization algorithm of the Grain family, and show that it can be used to reduce by half the cost of exhaustive key search (currently the most ...
De Cannière, Christophe +2 more
openaire +2 more sources
Quantization in Control Systems and Forward Error Analysis of Iterative Numerical Algorithms [PDF]
, 2010 The use of control theory to study iterative algorithms, which can be considered as dynamical systems, opens many opportunities to find new tools for analysis of algorithms.
Constantinides, GA +2 more
core +2 more sources
A Didactic Analysis of Functional Queues
Informatics in Education, 2011 When first introduced to the analysis of algorithms, students are taught how to assess the best and worst cases, whereas the mean and amortized costs are considered advanced topics, usually saved for graduates.
Christian RINDERKNECHT
doaj +1 more source
AGRA: analysis of gene ranking algorithms [PDF]
Bioinformatics, 2011 Abstract Summary: Often, the most informative genes have to be selected from different gene sets and several computer gene ranking algorithms have been developed to cope with the problem. To help researchers decide which algorithm to use, we developed the analysis of gene ranking algorithms (AGRA) system that offers a novel technique for
Kocbek, Simon +8 more
openaire +4 more sources