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

394 results for “performance of algorithms”
Set a search alert
Research ArticleOpen accessEvery word in the titleImproving the Performance of Multivariate Bernoulli Model based Documents Clustering Algorithms using Transformation TechniquesPerumal Pitchandi, Nedunchezhian RajuProblem statement: Document clustering is the most important areas of data mining since they are very much and currently the subject of significant global research since such areas strengthen the enterprises of web intelligence, web mining, web search engine design and so forth. Generative models based on the multivariate Bernoulli and multinomial distributions have been widely used for text classification. … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,281 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleComparative Performance Evaluation of Routing Algorithms in IEEE 802.15.4 and IEEE 802.11 with Different Ad Hoc Routing ProtocolP. Anitha, C. ChandrasekarProblem statement: Wireless ADHOC networks are self organized dynamic networks can share wireless channel without any established central control standard for IEEE 802.11. Approach: The most common protocols are AODV, DSDV, DSR in ADHOC used to ensure the data transmission among themselves. To meet the need of low power and low cost IEEE 802.15.4 standard was developed for sensor networks. … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,409 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePerformance Optimization of Discrete Wavelets Transform Based Image Watermarking Using Genetic AlgorithmsA. Al-Haj, A. Abu-ErrubThe excellent spatial localization, frequency spread and multi-resolution characteristics of the Discrete Wavelets Transform (DWT), which were similar to the theoretical models of the human visual system, facilitated the development of many imperceptible and robust DWT-based watermarking algorithms. There had been extremely few proposed algorithms on optimized DWT-based image watermarking that can simultaneously provide perceptual transparency and robustness since these … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 6,324 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleMarkov-Modulated Bernoulli-Based Performance Analysis for Gentle BLUE and BLUE Algorithms under Bursty and Correlated TrafficAdeeb Alsaaidah, Mohd Zalisham, Mohd Fadzli, Hussein Abdel-JaberThis paper presents a performance study for Gentle BLUE (GB) under the bursty and correlated properties of aggregated network traffic. The Bernoulli Process (BP) fails to represent the properties of aggregated correlated and bursty traffic, so instead of that, MMBP has been used. MMBP is A 2D discrete-time Markov chain modeling for GB algorithm with two traffic classes, each with … …Journal of Computer Science, Vol. 12, Issue 6 · 30 Jun 2016 · 8,077 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePerformance Comparison of Three-Phase Shunt Active Power Filter AlgorithmsMoleykutty George, Kartik Prasad BasuThe usage of parallel converters is ever increasing. However, the voltage and current harmonics, zero-sequence and negative- sequence components of voltage and current and reactive power present in parallel converters give an alarming signal to power system and power electronic engineers. This research discusses performance of three-phase shunt active power filter (APF) system using three different control techniques namely synchronous … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 6,810 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMapping Learning Algorithms on Data, a Useful Step for Optimizing Performances and Their ComparisonFilippo NeriIn this paper, we propose a novel methodology to map learning algorithms on data (performance map) in order to gain more insights into the distribution of their performances across their parameter space. This methodology provides useful information when selecting a learner's best configuration for the data at hand and it also enhances the comparison of learners across learning contexts. In … …Journal of Computer Science, Vol. 20, Issue 9 · 10 Jul 2024 · 4,501 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 keywordsStudy of Performance Analysis in Wired and Wireless NetworkV.B. Kirubanand, S. PalaniammalProblem statement: The main intent of this study is to derive a high performance clientserver network using hub, switch, Bluetooth, WI-Fi and Wimax using the steadfast algorithms. Approach: This study mainly focuses on M/M (a,b)/1 markovian model with adaboost algorithm and user selection algorithms to find performance on wired and wireless technologies in terms of service rate, arrival rate, Expected … …American Journal of Applied Sciences, Vol. 8, Issue 8 · 19 Jul 2011 · 7,472 accessesView PDFCite
Research ArticleOpen accessIn the keywordsComparative Performance Study of Improved Heap Sort Algorithm on Different HardwareVandana Sharma, Satwinder Singh, K. S. KahlonProblem statement: Several efficient algorithms were developed to cope with the popular task of sorting. Improved heap sort is a new variant of heap sort. Basic idea of new algorithm is similar to classical Heap sort algorithm but it builds heap in another way. The improved heap sort algorithm requires nlogn-0.788928n comparisons for worst case and nlogn-n comparisons in average … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 6,824 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid Fog Resource Provisioning and Resource Allocation using MKFCM and FPANagarjun E, Dharamendra Chouhan, Dilip Kumar SMThe expansion of Internet of Things (IoT) deployments has motivated the Fog Computing (FC) paradigm, which brings mobile-edge and cloud resources together under a single model. Allocating and provisioning application tasks across such environments poses challenges due to constrained resource capabilities, heterogeneity, mobility, network hierarchy, and unpredictability. This paper addresses the need for additional computing devices that prioritize delay-sensitive applications … …Journal of Computer Science, Vol. 22, Issue 10 · 6 Oct 2026 · 462 accessesView PDFCite