Filters








110,136 Hits in 4.9 sec

Pattern matching in pseudo real-time

Raphaël Clifford, Benjamin Sach
2011 Journal of Discrete Algorithms  
We show in this work how to tackle online approximate matching when the distance function is non-local.  ...  It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as being local.  ...  The authors would also like to thank the anonymous reviewer for pointing out the link between self-normalised matching and L 2 -rearrangement distances.  ... 
doi:10.1016/j.jda.2010.09.005 fatcat:sr3p42h2vjfmzjc5rs7ippqpb4

Effective variation management for pseudo periodical streams

Lv-an Tang, Bin Cui, Hongyan Li, Gaoshan Miao, Dongqing Yang, Xinbiao Zhou
2007 Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07  
In some data streams, successive events seem to recur in a certain time interval, but the data indeed evolves with tiny differences as time elapses.  ...  We propose a new method named Pattern Growth Graph (PGG) to detect and manage variations over pseudo periodical streams.  ...  In real applications, two sequences are assumed to match if their paths roughly coincide.  ... 
doi:10.1145/1247480.1247511 dblp:conf/sigmod/TangCLMYZ07 fatcat:u53ku7c3y5adjgo6sder3rgoqu

Analysis and Synthesis of Pseudo-Periodic Job Arrivals in Grids: A Matching Pursuit Approach

Hui Li, Richard Heusdens, Michael Muskulus, Lex Wolters
2007 Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)  
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids.  ...  The matching pursuit decomposition is well localized both in time and frequency, and it is naturally suited for analyzing non-stationary as well as stationary signals.  ...  Empirical Evaluation In this section we present experimental studies on real world workload data which show pseudo-periodic job arrival patterns.  ... 
doi:10.1109/ccgrid.2007.23 dblp:conf/ccgrid/LiHMW07 fatcat:h5youbs5rzhtzhtk7yv6xyhkdq

The processing of English regular inflections: Phonological cues to morphological structure

Brechtje Post, William D. Marslen-Wilson, Billi Randall, Lorraine K. Tyler
2008 Cognition  
The results show that any stimulus that can be interpreted as ending in a regular inflection, whether it is a real inflection (filled-fill), a pseudo-inflection (mild-mile) or a phonologically matched  ...  We report an auditory speeded judgment experiment which explored the contribution of these critical morpho-phonological properties (labelled as the English inflectional rhyme pattern) to the processing  ...  All three sets are matched to each other, and to the real regulars, in their CV structure.  ... 
doi:10.1016/j.cognition.2008.06.011 pmid:18834584 pmcid:PMC2596971 fatcat:z6o2wvhd5rdz7b2ttma5r54a74

A discovery about the positional distribution pattern among candidate homologous pixels and its potential application in aerial multi-view image matching

Ka Zhang, Wen Xiao, Yehua Sheng, Junshu Wang, Shan Zhang, Longjie Ye
2021 Scientific Reports  
Firstly, the definition and computing method of pixel's pseudo object-space coordinates are given, which can transform the problem of multi-view matching for confirming real homologous pixels into the  ...  AbstractIn aerial multi-view photogrammetry, whether there is a special positional distribution pattern among candidate homologous pixels of a matching pixel in the multi-view images?  ...  Local methods have advantages in computation efficiency, so can be used for real-time processing.  ... 
doi:10.1038/s41598-021-89501-z pmid:33980928 fatcat:65v4nfjqybdlzhdcf5z3oekbry

Awareness of form-sound correspondence in Chinese children with dyslexia: Preliminary results from event-related potentials and time frequency analyses

I-Fan Su, Dustin K-Y. Lau, Nan Yan, Sam-Po Law, Zhiguo Zhang
2011 2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)  
An opposite pattern was observed for PR, where greater effort was needed to retrieve information related to real and regular characters whilst failing to respond to pseudo and irregular characters.  ...  This study investigates form-sound awareness in Chinese reading-impaired children in terms of regularity, consistency and lexicality effects using event-related potentials (ERP) and time-frequency analysis  ...  ACKNOWLEDGMENT The authors would like to thank PR and CA for their participation in the study, and Dr. Lan Shuai for her help during the initial preparation and data collection stage.  ... 
doi:10.1109/bmei.2011.6098430 dblp:conf/bmei/SuLYLZ11 fatcat:4rv27r3fcvaqrmk2y6g3jcarau

Phonology and neuropsychology of the English past tense

Lorraine K Tyler, Billi Randall, William D Marslen-Wilson
2002 Neuropsychologia  
These real word conditions were accompanied by matched sets of non-words (e.g. nugged/nug).  ...  We compared patients' ability to detect the difference between the past tense and stem of regular (hugged/hug) and irregular (taught/teach) past tense verbs, as well as matched "pseudo" pairs (trade/tray  ...  Acknowledgements We thank Matt Davis for his help in the early stages of the first experiment. This work was supported by an MRC programme grant to L.K. Tyler.  ... 
doi:10.1016/s0028-3932(01)00232-9 pmid:11931919 fatcat:l3clvfeuebhxjlsmbtmvmtj7zi

Design and Implementation of a High-Speed RFID Data Filtering Engine [chapter]

Hyunsung Park, Jongdeok Kim
2006 Lecture Notes in Computer Science  
In addition, we also discovered that there are strong temporal relations and redundancy in the RFID data filtering operations.  ...  In this paper, we present a high-speed RFID data filtering engine designed to carry out filtering under the conditions of massive data and massive filters.  ...  We let each Virtual Reader send 500 tags per second on average in the real time.  ... 
doi:10.1007/11807964_43 fatcat:it3ulzjdynajphsyvxnwhifczi

Development of neural specialization for print: Evidence for predictive coding in visual word recognition

Jing Zhao, Urs Maurer, Sheng He, Xuchu Weng, David Poeppel
2019 PLoS Biology  
In contrast, N1 responses were reduced to lower-regularity stimuli in children who showed high efficiency of lexical classification (low prediction error).  ...  children who were less efficient in lexically classifying these stimuli (high prediction error).  ...  (B) Reaction time data of character responses; 7-and 9-year-olds showed no reaction time differences between pseudo and real characters, while 11-year-olds showed longer reaction times when classifying  ... 
doi:10.1371/journal.pbio.3000474 pmid:31600192 pmcid:PMC6805000 fatcat:jth4lnh5hjhcdi7q3ctrertzsy

Optimizing Regular Expression Matching with SR-NFA on Multi-Core Systems

Yi-Hua E. Yang, Viktor K. Prasanna
2011 2011 International Conference on Parallel Architectures and Compilation Techniques  
., on average 200k states in the STT, the proposed SR-NFA is 367k times faster to construct and update and use 23k times less memory than the DFA approach.  ...  Running on an 8-core 2.6 GHz Opteron platform, our prototype achieves 2.2 Gbps average matching throughput for regex sets with up to 4,000 SR-NFA states per regex set.  ...  sub-regexes) in real-world SR-NFAs.  ... 
doi:10.1109/pact.2011.73 dblp:conf/IEEEpact/YangP11 fatcat:v6to4flzsbbnbo66mjora3m3xq

An Educational System for Personalized Teacher Recommendation in K-12 Online Classrooms [article]

Jiahao Chen, Hang Li, Wenbiao Ding, Zitao Liu
2021 arXiv   pre-print
Our system consists of (1) a pseudo matching score module that provides reliable training labels; (2) a ranking model that scores every candidate teacher; (3) a novelty boosting module that gives additional  ...  Furthermore, we show that our approach is able to reduce the number of student-teacher matching attempts from 7.22 to 3.09 in a five-month observation on a third-party online education platform.  ...  More specifically, we design techniques to (1) generate robust pseudo training labels as ground truth for learning patterns of good matches between students and teachers; (2) boost newly arrived teachers  ... 
arXiv:2107.07124v1 fatcat:xc7bc6vs5vbktjxbbakujmooju

Optimal Decoding of Stripe Patterns with Window Uniqueness Constraint [chapter]

Shuntaro Yamazaki, Masaaki Mochimaru
2013 Lecture Notes in Computer Science  
We propose an optimal algorithm for solving correspondences problem in one-shot depth acquisition using color stripe patterns composed of pseudo-random sequence (PRS).  ...  The proposed algorithm has linear time complexity with respect to the size of image, which is of the same order as conventional dynamic programming matching.  ...  A number of different approaches to this problem are proposed, such as, real-time laser scanning [1] , time-of-flight camera [2] , and stereo vision systems [3] .  ... 
doi:10.1007/978-3-642-40303-3_1 fatcat:sqf22lsbgrbd3ktw254veq4v64

Segmental Semi-Markov Model Based Online Series Pattern Detection Under Arbitrary Time Scaling [chapter]

Guangjie Ling, Yuntao Qian, Sen Jia
2006 Lecture Notes in Computer Science  
Efficient online detection of similar patterns under arbitrary time scaling of a given time sequence is a challenging problem in the real-time application field of time series data mining.  ...  However, it can only detect the matching sequences with approximately equal length to that of the query pattern.  ...  Efficient online detection of similar patterns under arbitrary time scaling of a given time sequence (see Fig. 1 ) is a challenging problem in the real-time application field of time series data mining  ... 
doi:10.1007/11811305_80 fatcat:uaedsf6kuzgirdrj36qk7d4fzq

Attributed string matching by split-and-merge for on-line Chinese character recognition

Yih Tay Tsay, Wen Hsiang Tsai
1993 IEEE Transactions on Pattern Analysis and Machine Intelligence  
In both phases, dynamic programming is employed for stroke or character matching. Good experimental results prove the feasibility of the proposed approach for cursive Chinese character recognition.  ...  The proposed recognition scheme consists of two phases: candidate character selection and detailed matching. also grateful to B. Ceurstemont for his programming assistance.  ...  In addition, to reduce the computation time, it is assumed that the maximum number of real primitives allowed in a merge operation is three.  ... 
doi:10.1109/34.192491 fatcat:4spiol6cgjdffnmlwis2jskonu

Image Analysis Using Mathematical Morphology

Robert M. Haralick, Stanley R. Sternberg, Xinhua Zhuang
1987 IEEE Transactions on Pattern Analysis and Machine Intelligence  
In both phases, dynamic programming is employed for stroke or character matching. Good experimental results prove the feasibility of the proposed approach for cursive Chinese character recognition.  ...  The proposed recognition scheme consists of two phases: candidate character selection and detailed matching. also grateful to B. Ceurstemont for his programming assistance.  ...  In addition, to reduce the computation time, it is assumed that the maximum number of real primitives allowed in a merge operation is three.  ... 
doi:10.1109/tpami.1987.4767941 fatcat:eoofyquaqnfqxeas6k6jdxbvxq
« Previous Showing results 1 — 15 out of 110,136 results