An Efficient Procedure for Mining Statistically Significant Frequent Itemsets
Predrag Stanišić, Savo Tomović (2010)
Publications de l'Institut Mathématique
Similarity:
Predrag Stanišić, Savo Tomović (2010)
Publications de l'Institut Mathématique
Similarity:
Thomas Berry, Somasundaram Ravindran (2002)
Kybernetika
Similarity:
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm...
Caruso, Fabrizio (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Quan G. Zhang, Costas N. Georghiades (1999)
Kybernetika
Similarity:
For a direct-sequence spread-spectrum (DS-SS) system we pose and solve the problem of maximum-likelihood (ML) sequence estimation in the presence of narrowband interference, using the expectation-maximization (EM) algorithm. It is seen that the iterative EM algorithm obtains at each iteration an estimate of the interference which is then subtracted from the data before a new sequence estimate is produced. Both uncoded and trellis coded systems are studied, and the EM-based algorithm...
Drezner, Zvi (2002)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Anna Kobusińska, Jerzy Brzeziński, Michał Boroń, Łukasz Inatlewski, Michał Jabczyński, Mateusz Maciejewski (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon-a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved....