Results 81 to 90 of about 47,244 (120)
Some of the next articles are maybe not open access.
2014 Tenth International Conference on Signal-Image Technology and Internet-Based Systems, 2014
An improved SPIHT algorithm that combines the SPIHT and the sub bands threshold calculation to reduce the number of comparison operations, without sacrificing the reconstructed image quality, is proposed. After applying discrete wavelet transform to the image, the threshold of each independent sub band is calculated.
Humberto de Jesús Ochoa Domínguez +2 more
openaire +1 more source
An improved SPIHT algorithm that combines the SPIHT and the sub bands threshold calculation to reduce the number of comparison operations, without sacrificing the reconstructed image quality, is proposed. After applying discrete wavelet transform to the image, the threshold of each independent sub band is calculated.
Humberto de Jesús Ochoa Domínguez +2 more
openaire +1 more source
An Improved DCI_Closed Algorithm
2015 International Conference on Intelligent Networking and Collaborative Systems, 2015Frequent itemsets mining will not conducive to data analysis. Because of frequent itemsets mining produce very large amount of frequent itemsets in the case large data. Frequent closed itemsets provides a lossless frequent item sets, the smallest representation.
Yongming Miao, Hong Wang
openaire +1 more source
BIT, 1982
Three planarity algorithms PA-1, PA-2, and PA-3 are presented which are substantial improvements upon those of Demoucronet al. and Rubin, respectively. The algorithms test the planarity of a graphG by attempting to embed it into the plane step by step. If such an embedding can succeed,G is determined as planar and its planar representation is acquired ...
openaire +2 more sources
Three planarity algorithms PA-1, PA-2, and PA-3 are presented which are substantial improvements upon those of Demoucronet al. and Rubin, respectively. The algorithms test the planarity of a graphG by attempting to embed it into the plane step by step. If such an embedding can succeed,G is determined as planar and its planar representation is acquired ...
openaire +2 more sources
An improvement for dEclat algorithm
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, 2012The diffset format (the difference of two sets) has drastically reduced the running time and memory usage of the Eclat algorithm and the Eclat algorithm using diffset format is called dEclat algorithm. However, in some sparse datasets, diffset format loses its advantage over tidset format (set of transaction IDs) and in this case it is suggested to use
Tuan A. Trieu, Yoshitoshi Kunieda
openaire +1 more source
2010 IEEE International Conference on Granular Computing, 2010
In order to improve efficiency of excavation in relational database with multi-dimensional association rules, this paper analyzed Apriori algorithm and BUC algorithm based on practice. Then an improved Apriori algorithm-DGP algorithm which based on the multidimensional association rule was presented, it has more efficient and it will be used in the ...
Yongge Shi, Yiqun Zhou
openaire +1 more source
In order to improve efficiency of excavation in relational database with multi-dimensional association rules, this paper analyzed Apriori algorithm and BUC algorithm based on practice. Then an improved Apriori algorithm-DGP algorithm which based on the multidimensional association rule was presented, it has more efficient and it will be used in the ...
Yongge Shi, Yiqun Zhou
openaire +1 more source
An Improved Algorithm of Prefixspan
2016 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2016Aiming at the PrefixSpan algorithm produce huge amount of project databases in mining sequence patterns, this paper proposes an Improved PrefixSpan algorithm for Mining Sequential Patterns(IPMSP) algorithm. By avoid produce duplicated project databases with the same prefix pattern through checking the prefix with regard to prefix of the sequence ...
Pengfei Li, Songling Shan
openaire +1 more source
An improved equivalence algorithm
Communications of the ACM, 1964An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented. The algorithm is based on a tree structure, and has reduced computation time by 40 percent over a previously published algorithm by identifying all equivalence classes with one scan of the EQUIVALENCE declarations. The method is applicable in
Bernard A. Galler, Michael J. Fischer
openaire +1 more source
2010 International Conference on Machine Vision and Human-machine Interface, 2010
XTR is an excellent public key system that is suitable for variety of environments. XTR can achieve the same communication and security advantages at a much lower computational cost because of small keys and fast key selection. The computation of Sn(c) given c is an important algorithm in XTR. This paper suggests an improved algorithm to compute Sn(c).
Shiming Li +4 more
openaire +1 more source
XTR is an excellent public key system that is suitable for variety of environments. XTR can achieve the same communication and security advantages at a much lower computational cost because of small keys and fast key selection. The computation of Sn(c) given c is an important algorithm in XTR. This paper suggests an improved algorithm to compute Sn(c).
Shiming Li +4 more
openaire +1 more source
Research on the Improvements on Atallah's Algorithm: A New Improved Algorithm on Atallah
2011 Third International Conference on Communications and Mobile Computing, 2011In this paper, we give a new algorithm evolving from Atallah's algorithm proposed in 1984, and we make many improvements: First, combining replaced sewing in order to simplify the third step, Second, we delete the fourth step. And we simplify the construction of the auxiliary graph, avoiding the second time to find Euler tour and the introduction of a ...
Shan Liu +3 more
openaire +1 more source
Improved diagnosability algorithms
IEEE Transactions on Computers, 1991The concepts of the PMC and BGM self-diagnosing system models of F. P. Preparata et al. (1967) and F. Barsi et al. (1976), respectively, including the notions of fault sets, consistency, and diagnosability number, are reviewed. Two one-step diagnosability algorithms are applied, one to the PMC model and the other to the BGM model.
Vijay Raghavan 0002, Anand R. Tripathi
openaire +1 more source