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

341 results for “T-Match”
Set a search alert
Research ArticleOpen accessEvery word in the titleRobust Template Matching Using Orthogonal Legendre Moment InvariantsKhalid M. HosnyProblem statement: Template matching is a famous methodology that has a wide range of applications in image and signal processing. For a template and input image, template matching methodology finds the partial input image that is most closely matches the template image in terms of specific criterion such as the Euclidean distance or cross-correlation. Approach: In this study, a fast … …Journal of Computer Science, Vol. 6, Issue 10 · 30 Jul 2010 · 7,617 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Novel Approach to Signal Detection of Sensor Array Units Using 5-3-1 Rule Based Matched Filter Algorithm with Intelligent IdentifiersMahmoud Z. IskandaraniA novel approach to signal detection and identification was developed and tested. The new algorithm was based on provision of tagging a Matched Filter (MF) with identifiers to recognize the source signal with and without noise, so that classification can be carried out. The algorithm was applied successfully to chemical Sensor Array Units (SAU). Problem statement: Signals obtained from chemical … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 2 · 30 Jun 2010 · 7,835 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleTwigX-Guide: Twig Query Pattern Matching for XML TreesSu-Cheng Haw, Chien-Sing LeeThe growing importance of XML and the lack of efficient solutions for managing and querying XML data have led to the development of hybrid systems. We present a hybrid system, TwigX-Guide; an extension of the well-known DataGuide index and region encoding labeling to support twig query processing. With TwigX-Guide, a complex query can be decomposed into a set of path … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 7,078 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleTwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query ProcessingSu-Cheng Haw, Chien-Sing LeeThe emergence of the Web has increased significant interests in querying XML data. Current methods for XML query processing still suffers from producing large intermediate results and are not efficient in supporting query with mixed types of relationships. We propose the TwigINLAB algorithm to process and optimize the query evaluation. Our TwigINLAB adopts the decomposition-matching-merging approach and focuses on optimizing … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 6,988 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Pattern Matching Algorithm with Two Sliding Windows (TSW)Amjad Hudaib, Rola Al-Khalid, Dima Suleiman et al.In this research, we propose a fast pattern matching algorithm: The Two Sliding Windows (TSW) algorithm. The algorithm makes use of two sliding windows, each window has a size that is equal to the pattern length. Both windows slide in parallel over the text until the first occurrence of the pattern is found or until both windows reach the middle … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 7,499 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSimplified Block Matching Algorithm for Fast Motion Estimation in Video CompressionM. Ezhilarasan, P. ThambiduraiBlock matching motion estimation was one of the most important modules in the design of any video encoder. It consumed more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. To minimize the search time on block matching, a simplified and efficient Block Matching Algorithm for Fast Motion … …Journal of Computer Science, Vol. 4, Issue 4 · 30 Apr 2008 · 7,041 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAnalysis of String Matching Compression AlgorithmsKrishnaveny Nadarajan, Zuriati A. ZukarnainThe improvement rate in microprocessor speed by far exceeds the improvement in DRAM memory. This increasing processor-memory performance gap is the primary obstacle to improved computer system performance. As a result, the size of main memory has increased gradually. To utilize main memory’s resources effectively, data compression can be applied. Through compression, the data can be compressed by eliminating redundant … …Journal of Computer Science, Vol. 4, Issue 3 · 31 Mar 2008 · 7,293 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA New Algorithm for Subset Matching ProblemYangjun ChenThe subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet ∑. The pattern is said to occur at text position i if the set p[j] is a subset of the … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,737 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallel 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 PDFCite
Research ArticleOpen accessEvery word in the titleA Discrete Optimization Description for the Solutions in the Matching ProblemWalied H. SharifThis study was concerned with the characterization of solutions in the matching problem. The general mixed-integer programming problem is given together with the definition of the convex hull of the integer solutions. In addition, the matching problem is defined as an integer problem and an algorithm is described to find the optimum matchings. Some illustrative examples are introduced to clarify … …Journal of Mathematics and Statistics, Vol. 2, Issue 1 · 31 Mar 2006 · 6,896 accessesView PDFCite