Filters








1,525,131 Hits in 6.7 sec

Matching patterns vs matching digits: The effect of memory dependence and complexity on "same"-"different" reaction times

Joan Gay Snodgrass
1972 Perception & Psychophysics  
Matching patterns vs matehing digits: The effect of memory dependence and complexity on "same"-"different" reaction times* Two experiments are reported in which "same"-"different" reaction times (RTs)  ...  Some evidence was obtained that the form of encoding for both patterns and digits in the memory task was visuaI. These results are discussed in terms of encoding and comparison strategies.  ...  The two stimuli may be presented successively, in which case the match is said to be memory-dependent, or simultaneously, in which case the match depends on visual factors.  ... 
doi:10.3758/bf03206264 fatcat:vvzqtqo4zvembfecarcpxljpve

Reduction of Computation Time in Pattern Matching for Speech Recognition

Munshi Yadav, Afshar Alam
2014 International Journal of Computer Applications  
Dynamic Time Warping (DTW) algorithm has been used in different application for the pattern matching, where the sample and stored reference data size is not equal due to time invariant or due to speed.  ...  DTW has been implemented and tested by various ways by different researchers for improving the efficiency of the algorithm. There are challenges of accuracy within reasonable time and cost of memory.  ...  and time complexity for pattern matching algorithm is O(N*N) Therefore we get total time complexity= O(N*N*N) If d=N and th=N then time complexity of pattern matching algorithm = O(1) Total time complexity  ... 
doi:10.5120/15823-4695 fatcat:5l74uukjkvhadfcb4z7xvlmzlq

Study Of Different Pattern Matching Algorithms And It'S Applications

Miss. Ketak I H. Pangu, Mr. Rahu L R. Date
2016 Zenodo  
Pattern matching algorithms are used to find one or more patterns or sequence of patterns from huge data or symbols.  ...  Pattern matching algorithms works for many purpose in engineering as well as in bioinformatics.  ...  INTRODUCTION Pattern matching algorithms are one of the important areas in computer science field.  ... 
doi:10.5281/zenodo.1469376 fatcat:umtfi2he7vetjj6gb6g75ypq7m

PARTITION-BASED PATTERN MATCHING APPROACH FOR EFFICIENT RETRIEVAL OF ARABIC TEXT

Saqib Hakak, Amirrudin Kamsin, Palaiahnakote Shivakumara, Mohd. Yamani Idna Idris
2018 Malaysian Journal of Computer Science  
The experimental results are used to evaluate the proposed approach in terms of processing time.  ...  Encoding for Arabic based on the Unicode Transformation Format (UTF) differs from encoding for English based on the American Standard Code for Information Interchange (ASCII) since the Arabic usage of  ...  Acknowledgement This research work was supported by Faculty of Computer Science and Information Technology, University of Malaya under a special allocation of Post Graduate Fund and IPPP research fund  ... 
doi:10.22452/mjcs.vol31no3.3 fatcat:a22jffr3sjgobo4zzwgw6gn32q

An Algorithm for String Searching

Rawan Ali
2019 International Journal of Computer Applications  
The proposed algorithm aims to improve the brute-force searching algorithm. It finds all the occurrences of a pattern within a given text.  ...  The pattern and the text are to be preprocessed before the actual searching starts.  ...  However, if the first character of the pattern matches the first character of the segment of the text while the last character does not match then its time complexity would be O((n-m+1) *2).  ... 
doi:10.5120/ijca2019919484 fatcat:vsik4ckqdnacrg4lkfc46lb4se

A Practical Distributed String Matching Algorithm Architecture And Implementation

Bi Kun, Gu Nai-Jie, Tu Kun, Liu Xiao-Hu, Liu Gang
2007 Zenodo  
Its computation complexity is O(n/p + m), where n is the length of the text, and m is the length of the pattern, and p is the number of the processors.  ...  Traditional parallel single string matching algorithms are always based on PRAM computation model. Those algorithms concentrate on the cost optimal design and the theoretical speed.  ...  So the worst case time complexity of the improved single string matching algorithm is ( ) O n m + . □ , the pattern of length m needs to be broadcasted to all of the processors, if the binomial tree-based  ... 
doi:10.5281/zenodo.1072517 fatcat:n4m2yzraxjc7za4bmmxigfcxz4

An Efficient AC Algorithm with GPU

Liang Hu, Zhen Wei, Feng Wang, Xiaolu Zhang, Kuo Zhao
2012 Procedia Engineering  
In this paper, we present an AC Multi-pattern matching algorithm based on GPU with the parallelization of traditional algorithm based on CPU, and the matching efficiency may be significantly improved due  ...  Pattern matching algorithm is the basis of information biology as well as information retrieval research field.  ...  AC pattern matching algorithm time complexity is O(n), have nothing to do with the number of pattern strings and the length of each pattern string.  ... 
doi:10.1016/j.proeng.2012.01.652 fatcat:rrre6h2eyfa3xk5w5mcrpnsbgu

State-based Event Detection Optimization for Complex Event Processing

Shanglian PENG, Haoxia LIU, Xiaolin GUO, Jia HE
2014 Sensors & Transducers  
With this partition, the same individual state of NFA is run on different processing nodes, providing states sharing and reducing partial matches maintenance.  ...  To assure real-time responsive complex pattern detection over high volume and speed event streams, efficient event detection techniques have to be designed.  ...  One of the most critical capabilities for CEP systems is the ability to support real time pattern matches over sequences of events.  ... 
doaj:886baa83d08a4eeb8685118eb2f3c9da fatcat:2732zup42vesfe6cyhhxgawtvq

Page 5974 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
In both cases, the asymptotic worst-case time complexity of tree pattern unification is quadratic, as in the special case of tree pattern matching.  ...  However, the expected time complexity of thepattern-eliminating’ algorithm is linear in the size of input. The possibility of dynamization of the set of input pattern terms is also discussed.  ... 

The improving pattern matching algorithm of intrusion detection

Zhaoyang Qu, Xiaobo Huang
2011 Procedia Engineering  
During the detection process, the efficiency of pattern matching algorithm determines the performance of the intrusion detection system.  ...  Based on this point, this paper proposed an improved algorithm, increased the skip distance of the text string pointer, and reduced the number of comparisons.  ...  Acknowledgements This work was supported by the National Natural Science Foundation of China (No.51077010) and Natural Science Foundation of Jilin Province (No.20101517).  ... 
doi:10.1016/j.proeng.2011.08.535 fatcat:q2mbxn65vvbrlgt2jzdbmoyuti

On-Line Elimination of Non-relevant Parts of Complex Objects in Behavioral Pattern Identification [chapter]

Jan G. Bazan, Andrzej Skowron
2005 Lecture Notes in Computer Science  
This method was developed for on-line elimination of complex object parts that are irrelevant for identifying a given behavioral pattern.  ...  Such networks make it possible to recognize behavioral patterns of objects and their parts changing over time.  ...  The research has been supported by the grant 3 T11C 002 26 from Ministry of Scientific Research and Information Technology of the Republic of Poland.  ... 
doi:10.1007/11590316_116 fatcat:gvour3tu5bfqzjukfiqdbwhnji

Visual pattern matching: Effects of size ratio, complexity, and similarity in simultaneous and successive matching

Axel Larsen, William McIlhagga, Claus Bundesen
1999 Psychological Research  
testing for a match; in simultaneous matching the process of encoding, transformation, and comparison appeared to be executed several times for each pair of ®gures.  ...  The slopes of the functions showed signi®cant eects of ®gural complexity and similarity for simultaneous but not for successive matching.  ...  The patterns may be presented side by side at the same time (simultaneous matching) or one by one in temporal succession (successive matching).  ... 
doi:10.1007/s004260050058 fatcat:xyie4ifhmvbyzmeqlsu5mhluge

Implementation and Application of Automata in String Processing [chapter]

Gonzalo Navarro
2009 Lecture Notes in Computer Science  
Alternatively one can omit step (2) and backtrack with the DFA on the suffix tree of the sequence, which leads to sublinear-time complex pattern matching in many relevant cases.  ...  Automata have been enormously successful in matching different types of complex patterns on sequences, with applications in many areas, from text retrieval to bioinformatics, from multimedia databases  ...  Alternatively one can omit step (2) and backtrack with the DFA on the suffix tree of the sequence, which leads to sublinear-time complex pattern matching in many relevant cases.  ... 
doi:10.1007/978-3-642-02979-0_1 fatcat:wq4kdu76sncw3oktj3u72igwo4

Slice Distance: An Insert-Only Levenshtein Distance with a Focus on Security Applications

Zeeshan Afzal, Johan Garcia, Stefan Lindskog, Anna Brunstrom
2018 2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)  
For Algorithm 1, it can be seen that in general, the pattern length is the bound on time complexity. Let us now use the examples from above to further explain the time complexity.  ...  Section III formally presents the slice distance algorithm and its variations along with a discussion on time complexity.  ... 
doi:10.1109/ntms.2018.8328718 dblp:conf/ntms/AfzalGLB18 fatcat:fu7netbcanggfnt73ugnm7jrom

On complexity and optimization of expensive queries in complex event processing

Haopeng Zhang, Yanlei Diao, Neil Immerman
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
To support these expensive queries with high performance, we begin our study by analyzing the complexity of pattern queries, with a focus on the fundamental understanding of which features make pattern  ...  queries more expressive and at the same time more computationally expensive.  ...  If the subset of SQL used is relaxed to the bigger set with recursion, its expressiveness and complexity is way up in P-time-this level of complexity is not needed for pattern queries in CEP.  ... 
doi:10.1145/2588555.2593671 dblp:conf/sigmod/ZhangDI14 fatcat:3gx55ealy5cflbd2lrp4eew7ji
« Previous Showing results 1 — 15 out of 1,525,131 results