57 results for “parallel computation”

Set a search alert

Research ArticleOpen accessIn the abstractImproving the Performance of Backpropagation Neural Network Algorithm for Image Compression/Decompression SystemOmaima N.A. AL-AllafProblem statement: The problem inherent to any digital image is the large amount of bandwidth required for transmission or storage. This has driven the research area of image compression to develop algorithms that compress images to lower data rates with better quality. Artificial neural networks are becoming attractive in image processing where high computational performance and parallel architectures are required. … …Journal of Computer Science, Vol. 6, Issue 11 · 26 Oct 2010 · 8,370 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEfficient Detection Algorithm for a Multiple-Input and Multiple-Output Multiuser Multi-Carrier Code Division Multiple Access in Time-Varying ChannelsFares Sayadi, Mahamod Ismail, Norbahiah Misran et al.Problem statement: Maximum Likelihood (ML) decoding has been applied for the uplink of a Multi-Carrier Code Division Multiple Access (MC-CDMA) system based on Orthogonal Frequency Division Multiplexing (OFDM). Multiple-Input Multiple-Output (MIMO) channel from k users, which moves at vehicular speed, to the Base-Station (BS) is time-varying. For time-varying channels, Sphere Decoding (SD) was introduced to perform ML decoding. Whereas, computational … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 7,576 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComputational Discrete Time Markov Chain with Correlated Transition ProbabilitiesPeerayuth CharnsethikulThis study presents a computational procedure for analyzing statistics of steady state probabilities in a discrete time Markov chain with correlations among their transition probabilities. The proposed model simply uses the first order Taylor’s series expansion and statistical expected value properties to obtain the resulting linear matrix equations system. Computationally, the bottleneck is O(n4) but can be improved by distributed … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 6,648 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Feasibility Study of Challenges and Opportunities in Computational Biology: A Malaysian PerspectiveR. J.A. Richard, N. SriraamThe term computational biology refers to the knowledge derived from a computer analysis of biological data that includes identification of genes in DNA sequence of different organisms, prediction of structural and functional mechanism of proteins, feature extraction and classification of genomics and proteomics. Computational biology is a rapidly developing branch of science and is highly interdisciplinary, using techniques and Concepts … …American Journal of Applied Sciences, Vol. 2, Issue 9 · 30 Sep 2005 · 6,924 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordUsing 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 PDF Cite

Research ArticleOpen accessAll words, across the recordIncremental DataGrid Mining Algorithm for Mobility Prediction of Mobile UsersU. Sakthi, R.S. BhuvaneswaranProblem statement: Mobility prediction is the important issue in Personal Communication Systems (PCS). Mobile users moving logs are stored in data grid located in different locations. Distributed data mining algorithm is applied on this moving logs to generate the mobility pattern of mobile users. As new moving logs are added to the data grid, existing mobility pattern becomes invalid and … …Journal of Computer Science, Vol. 5, Issue 2 · 28 Feb 2009 · 6,775 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordParallel Algorithms for String Matching Problem on Single and Two Dimensional Reconfigurable Pipelined Bus SystemsS. Viswanadha Raju, A. Vinaya BabuWe considered string matching on LARPBS and 2D LARPBS. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using LARPBS. We investigated exact string matching and approximate string matching problems. For these two sub problems, we obtained O (n) … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,530 accessesView PDF Cite