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

85 results for “computational complexity”
Set a search alert
Research ArticleOpen accessPhrase in the titleA New High Order Algorithm with Low Computational Complexity for Electric Field SimulationMohammad Khatim Hasan, Jumat Sulaiman, Samsul Arifin Abdul KarimProblem statement: This research reported on new approach to improve speed of simulation time for free space electric wave propagation from an antenna. The existing method, Finite-Difference Time-Domain (FDTD) have been proven to solve the problem accurately, however, one of the drawbacks of the method was it needs a long processing time to simulate problem. Research efforts to increase the … …Journal of Computer Science, Vol. 6, Issue 7 · 31 Jul 2010 · 6,394 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleComputational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data PointsT. Velmurugan, T. SanthanamProblem statement: Clustering is one of the most important research areas in the field of data mining. Clustering means creating groups of objects based on their features in such a way that the objects belonging to the same groups are similar and those belonging to different groups are dissimilar. Clustering is an unsupervised learning technique. The main advantage of clustering … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 19,434 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPAPR Reduction Using BPSO/PTS and STBC in MIMO OFDM SystemKarima El Mouhib, Ahmed Oquour, Younes Jabrane et al.Problem statement: The Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) system has been receiving a great attention, as one of solutions for achieving high speed, efficient and high-quality service for the wireless communications. However, the transmitted signal still has high PAPR because of OFDM characteristics. Many methods have been proposed to solve this problem, but the most … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 7,189 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Comparative Computational Efficiency Analysis of LSB and Hybrid Steganographic MethodsDivya Sharma, Chander PrabhaElectronic Medical Images (EMI) are of various types such as X-rays, CT scans, MRIs, etc. EMIs are generally large, but they vary in dimensions and sizes based on the body part to which they belong. Not much research has been done to secure EMIs due to their varied and large sizes, while ensuring their accessibility for real-time transmission. Where access … …Journal of Computer Science, Vol. 21, Issue 10 · 28 Nov 2025 · 2,458 accessesView PDFCite
Review ArticleOpen accessIn the keywordsA Survey of Quadratization Methods Used in QUBO Formulations and their Usage in Quantum and Digital AnnealingGeethika Prabhath, Anuradha Mahasinghe, Nalin Ranasinghe, Kasun De ZoysaQuantum annealing is a metaheuristic method aimed at finding the global minimum of a pseudo-Boolean quadratic function. To solve a problem by a quantum annealer, it must be restated as a QUBO (quadratic unconstrained binary optimization) problem, the standard format acceptable to an annealer. However, there are many natural problems that turn out be of cubic or higher order, yet … …Journal of Computer Science, Vol. 22, Issue 1 · 16 Feb 2026 · 2,554 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe New Matrix Model of Computation Based Purely on Quite a New Concept of the Matrix Computations for Extremely Quick Web Pages LoadingZulfia A. ChotchaevaWe all dream of quick loading. Quicker than it is now. So that it loads immediately. What is needed for this? There are a lot of things to do. The most important things in it are computations. To speed up loading, we need to speed up computations. If we will find the way to multiply large numbers quicker than we … …Journal of Computer Science, Vol. 16, Issue 11 · 27 Nov 2020 · 10,683 accessesView PDFCite
Research ArticleOpen accessIn the keywordsImproving the Attack Detection Rate in Network Intrusion Detection using Adaboost AlgorithmP. Natesan, P. Balasubramanie, G. GowrisonProblem statement: Nowadays, the Internet plays an important role in communication between people. To ensure a secure communication between two parties, we need a security system to detect the attacks very effectively. Network intrusion detection serves as a major system to work with other security system to protect the computer networks. Approach: In this article, an Adaboost algorithm for network … …Journal of Computer Science, Vol. 8, Issue 7 · 16 May 2012 · 7,461 accessesView PDFCite
Research ArticleOpen accessIn the keywordsUsing Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment AlgorithmsEvandro A. Marucci, Geraldo F.D. Zafalon, Julio C. Momente et al.Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is … …Current Research in Bioinformatics, Vol. 1, Issue 1 · 8 Mar 2012 · 14,192 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Coordinated Scheduling Support System of Production and DeliveryMing-Feng Yang, Yi LinProblem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing … …American Journal of Applied Sciences, Vol. 6, Issue 4 · 30 Apr 2009 · 6,798 accessesView PDFCite
Review ArticleOpen accessIn the abstractA Comprehensive Review of Post-Quantum Cryptography AlgorithmsSamandeep Kaur, Jaswinder SinghThe development of quantum computing has been rapid, and an existential threat to computational hardness assumptions that underlie today's public-key cryptography has been encountered. This manuscript is a complete and thoroughly organized review of Post-Quantum Cryptography (PQC), discussing the mathematical concepts, complexity, and mechanisms of the algorithms that underpin quantum-safe security infrastructures. Rather than the principles of quantum mechanics, the … …Journal of Computer Science, Vol. 22, Issue 9 · 25 Sep 2026 · 723 accessesView PDFCite