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

890 results for “(CG) algorithms”
Set a search alert
Research ArticleOpen accessEvery word in the titleNEW TRACK-TO-TRACK CORRELATION ALGORITHMS BASED ON BITHRESHOLD IN A DISTRIBUTED MULTISENSOR INFORMATION FUSION SYSTEMLiu Yu, Wang Haipeng, He You et al.Track-to-Track correlation (or association) is an ongoing area of interest in the field of distributed multisensory information fusion. In order to perform accurately identifying tracks with common origin and get fast convergence, this study presents independent and dependent Bi-threshold Track Correlation Algorithms (called BTCAs), which are described in detail and the track correlation mass and multivalency processing methods are discussed … …Journal of Computer Science, Vol. 9, Issue 12 · 25 Nov 2013 · 6,647 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleImage Compression Algorithms Using Intensity Based Adaptive Quantization CodingSaad Al-Azawi, Said Boussakta, Alex YakovlevProblem statement: Low complexity image compression algorithms are necessary for modern portable devices such as mobile phones, wireless sensor networks and high constraint power consumption devices. In such applications low bit rate along with an acceptable image quality are an essential requirements. Approach: This study proposes low and moderate complexity algorithms for colour image compression. Two algorithms will be presented; … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 18 Jan 2012 · 8,501 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Qualitative Analysis of Independent Component Analysis Based Algorithms for the Removal of Artifacts from Electroencephalography SignalsBalaiah Paulchamy, Ilavennila, Jayabalan JayaProblem statement: Independent Component Analysis (ICA) based algorithms applied in the context to remove the artifacts from the EEG signals are evaluated with appropriate metrics and it compares and contrasts the performance of the different methods for such applications. The primary goal is to gain some insight into relative performance of the various methods. Approach: CA is a statistical and … …Journal of Computer Science, Vol. 8, Issue 3 · 6 Jan 2012 · 6,986 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Challenge for Routing Algorithms in Optical Multistage Interconnection NetworksMehrnaz Moudi, Mohamed OthmanProblem statement: A class of dynamic interconnection networks is Multistage Interconnection Networks (MINs) that connects input devices to output devices through a number of switch stages. MINs have assumed importance in recent years; because of their cost-effectiveness. Optical MINs are one type of MINs that have large transmission capacity in the communication networks. There is a major problem in Optical … …Journal of Computer Science, Vol. 7, Issue 11 · 29 Aug 2011 · 7,858 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleFast Algorithms for Discovering Sequential Patterns in Massive DatasetsS. Dharani, Justus Rabi, Nanda Kumar, DarlyProblem statement: Sequential pattern mining is one of the specific data mining tasks, particularly from retail data. The task is to discover all sequential patterns with a user-specified minimum support, where support of a pattern is the number of data-sequences that contain the pattern. Approach: To find a sequence patterns variety of algorithm like AprioriAll and Generalized Sequential Patterns (GSP) … …Journal of Computer Science, Vol. 7, Issue 9 · 23 Jul 2011 · 7,283 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleWeb Structure Mining: Exploring Hyperlinks and Algorithms for Information RetrievalP. Ravi Kumar, Ashutosh Kumar SinghProblem statement: A study on hyperlink analysis and the algorithms used for link analysis in the Web Information retrieval was done. Approach: This research was initiated because of the dependability of search engines for information retrieval in the web. Understand the web structure mining and determine the importance of hyperlink in web information retrieval particularly using the Google Search engine. … …American Journal of Applied Sciences, Vol. 7, Issue 6 · 30 Jun 2010 · 9,063 accessesView PDFCite
Research ArticleOpen accessEvery word 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,451 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleEnhanced Utility Accrual Scheduling Algorithms for Adaptive Real Time SystemIdawaty Ahmad, Muhammad Fauzan OthmanProblem statement: This study proposed two utility accrual real time scheduling algorithms named as Preemptive Utility Accrual Scheduling (PUAS) and Non-preemptive Utility Accrual Scheduling (NUAS) algorithms. These algorithms addressed the unnecessary abortion problem that was identified in the existing algorithm known as General Utility Scheduling (GUS). It is observed that GUS is inefficient for independent task model because it simply … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 6,356 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Hybrid Architecture Approach for Quantum AlgorithmsMohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, Hishamuddin ZainuddinProblem statement: In this study, a general plan of hybrid architecture for quantum algorithms is proposed. Approach: Analysis of the quantum algorithms shows that these algorithms were hybrid with two parts. First, the relationship of classical and quantum parts of the hybrid algorithms was extracted. Then a general plan of hybrid structure was designed. Results: This plan was illustrated the … …Journal of Computer Science, Vol. 5, Issue 10 · 31 Oct 2009 · 6,983 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Survey of Compute Intensive Algorithms for Ribo Nucleic Acids Structural DetectionRa’ed Al-Khatib, Rosni Abdullah, Nur’Aini Abdul RashidProblem statement: Finding an accurate RNA structural alignment from primary sequence due to it is time consuming and computationally NP-hard problem is a major bioinformatics challenge. According to our investigation majority of current researches were concerned on achieving faster execution time, improving space complexity and better cache management. Recently one research introduced cache-efficient Chip Multiprocessor (CMP) algorithms with good speed-up … …Journal of Computer Science, Vol. 5, Issue 10 · 31 Oct 2009 · 6,463 accessesView PDFCite