Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

122 results for “k-Means Algorithm”
Set a search alert
Research ArticleOpen accessIn the abstractA Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search AlgorithmsAbdulwahab Ali AlmazroiProblem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,403 accessesView PDFCite
Research ArticleOpen accessIn the abstractReduce Computation Steps Can Increase the Efficiency of Computation AlgorithmZulkarnain Md. AliProblem statement: Lucas function is a special form of second-order linear recurrence relation. It is used in LUC cryptosystems. The performance of LUC cryptosystem depends on the size of public key, messages and two relatively primes. The increasing of size of these parameters will increase the computation time need to perform the LUC Cryptosystem computation. The efficiency means the quality … …Journal of Computer Science, Vol. 6, Issue 10 · 24 Aug 2010 · 7,018 accessesView PDFCite
Research ArticleOpen accessIn the abstractSummarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering TechniquesRayner AlfredProblem statement: In solving a classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets stored in multiple tables into a single table. Unfortunately, we may loss some information when we join tables with a high degree of one-to-many association. Therefore, data transformation becomes a tedious trial-and-error work and … …Journal of Computer Science, Vol. 6, Issue 7 · 31 Jul 2010 · 7,588 accessesView PDFCite
Research ArticleOpen accessIn the abstractDropping down the Maximum Item Set: Improving the Stylometric Authorship Attribution Algorithm in the Text Mining for Authorship InvestigationTareef Kamil Mustafa, Norwati Mustapha, Masrah Azrifah Azmi, Nasir B. SulaimanProblem statement: Stylometric authorship attribution is an approach concerned about analyzing texts in text mining, e.g., novels and plays that famous authors wrote, trying to measure the authors style, by choosing some attributes that shows the author style of writing, assuming that these writers have a special way of writing that no other writer has; thus, authorship attribution is the … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,535 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplication of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly LineA. Norozi, M.K.A. Ariffin, N. IsmailProblem statement: In the area of globalization the degree of competition in the market increased and many companies attempted to manufacture the products efficiently to overcome the challenges faced. Approach: Mixed model assembly line was able to provide continuous flow of material and flexibility with regard to model change. The problem under study attempted to describe the mathematical programming limitation … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 1 · 31 Mar 2010 · 9,344 accessesView PDFCite
Research ArticleOpen accessIn the abstractSelf-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running ProcessesRami J. MatarnehProblem statement: The performance and efficiency of multitasking operating systems mainly depends on the used CPU scheduling algorithm where the CPU is one of the primary computer resources and as round robin scheduling algorithm is considered most widely used scheduling algorithms in this research a new proposed variant of this algorithm presented, discussed in detail, tested and verified. Approach: The … …American Journal of Applied Sciences, Vol. 6, Issue 10 · 31 Oct 2009 · 8,946 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Parallel Maximal Cliques Algorithm for Protein Sequence ClusteringKhalid Jaber, Nur’Aini Abdul Rashid, Rosni AbdullahProblem statement: Protein sequence clustering is a method used to discover relations between proteins. This method groups the proteins based on their common features. It is a core process in protein sequence classification. Graph theory has been used in protein sequence clustering as a means of partitioning the data into groups, where each group constitutes a cluster. Mohseni-Zadeh introduced a … …American Journal of Applied Sciences, Vol. 6, Issue 7 · 31 Jul 2009 · 7,103 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance of Unequal Error Protection Using Maximum A- posteriori Probability Algorithm and Modified MAP in Additive White Gaussian Noise and Fading ChannelT. Gnanasekaran, K. DuraiswamyProblem statement: In this study we propose a method to improve the performance of Maximum A-Posteriori Probability Algorithm, which is used in turbo decoder. Previously the performance of turbo decoder is improved by means of scaling the channel reliability value. Approach: A modification in MAP algorithm proposed in this study, which achieves further improvement in forward error correction by means … …Journal of Computer Science, Vol. 4, Issue 7 · 31 Jul 2008 · 6,689 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving Protein Folding Problem using Elitism-Based Compact Genetic AlgorithmAmr Badr, Ibtehal M. Aref, Basma M. Hussien, Yosr EmanProteins are vital components of living cells. A number of diseases such as Alzheimer's, Cystic fibrosis and Mad Cow diseases are shown to result from misfunctioning of proteins. Problem statement: Protein folding problem is the process of predicting the optimal 3D molecular structure of a protein, or tertiary structure, which is an indication of its proper function. Approach: An enhancement … …Journal of Computer Science, Vol. 4, Issue 7 · 31 Jul 2008 · 6,861 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving Linear Programming Problems on the Parallel Virtual Machine EnvironmentJrJung Lyu, Hsing Luh, Ming-Chang LeeThis study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the well-known method, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also provided in order to verify the complexity … …American Journal of Applied Sciences, Vol. 1, Issue 2 · 30 Jun 2004 · 7,841 accessesView PDFCite