Filters








33,585 Hits in 3.7 sec

Dictionary matching in a stream [article]

Raphael Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015 arXiv   pre-print
We consider the problem of dictionary matching in a stream.  ...  Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream.  ...  Introduction We consider the problem of dictionary matching in a stream.  ... 
arXiv:1504.06242v1 fatcat:zz7kmk67n5cmtbbaltaokctqta

Dictionary Matching in a Stream [chapter]

Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015 Lecture Notes in Computer Science  
We consider the problem of dictionary matching in a stream.  ...  Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream.  ...  Introduction We consider the problem of dictionary matching in a stream.  ... 
doi:10.1007/978-3-662-48350-3_31 fatcat:aaf7m4kzxnbq5hln7oaqtvfr5q

High-flexibility scalable image coding

Pascal Frossard, Pierre Vandergheynst, Rosa M. Figueras i Ventura, Touradj Ebrahimi, Thomas Sikora
2003 Visual Communications and Image Processing 2003  
In the same time, the Matching Pursuit algorithm provides an intrinsically progressive stream.  ...  This paper presents a new, highly flexible, scalable image coder based on a Matching Pursuit expansion.  ...  The image is first recursively decomposed, by Matching Pursuit, in a series of atoms chosen from a redundant dictionary, with their respective coefficients.  ... 
doi:10.1117/12.503188 fatcat:ixsoatbxnjgdblsrz2w22ep4tq

Modified Compression Techniques Based on Optimality of LZW Code (MOLZW)

Utpal Nandi, Jyotsna Kumar Mandal
2013 Procedia Technology - Elsevier  
A lossless dictionary-based data compression technique has been proposed in this paper which is the modified form of compression technique based on optimality of LZW code (OLZW).  ...  But, phrases added to the dictionary are all the string formed by concatenation of previous match and prefix of current match including current match itself.  ...  next match A.  ... 
doi:10.1016/j.protcy.2013.12.442 fatcat:ipenbst3g5eafhdhmq6sdugmbe

A high-speed and large-scale dictionary matching engine for Information Extraction systems

Kanak Agarwal, Raphael Polig
2013 2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors  
Typically achieve higher bandwidth by using multiple input streams in parallel Dictionary Matching Use-Case in IE  Matching requirements in IE environments are different than generic string matching  ...  kernels in IE tasks  Dictionary matching involves matching strings extracted from text documents against a dictionary of known patterns  Example, use of dictionary matching in Named-Entity Recognition  ...  parallel in single cycle  ... 
doi:10.1109/asap.2013.6567551 dblp:conf/asap/AgarwalP13 fatcat:rdbsui7orvdabhi63pers5pmzm

Memory-Efficient Pipelined Architecture for Large-Scale String Matching

Yi-Hua Edward Yang, Viktor K. Prasanna
2009 2009 17th IEEE Symposium on Field Programmable Custom Computing Machines  
Each bit-field input is matched in a partial state machine (PSM) pipeline constructed from the respective bit-field patterns.  ...  The matching results from all the bit-fields in every pipeline stage are then merged with the help of an auxiliary table (ATB).  ...  The string matching engine needs to handle input streams with per-stream throughput in the range of gigabits per second. 2) Large dictionary size.  ... 
doi:10.1109/fccm.2009.17 dblp:conf/fccm/YangP09 fatcat:56fqzumozfdsplvxqj2zzv56lq

High Performance Dictionary-Based String Matching for Deep Packet Inspection

Yi-Hua E. Yang, Hoang Le, Viktor K. Prasanna
2010 2010 Proceedings IEEE INFOCOM  
Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2] .  ...  Our prototype implementation of PASTA on an FPGA with 10 Mb on-chip block RAM achieves 3.2 Gbps matching throughput against a dictionary of over 700K characters.  ...  In DBSM, input byte-streams from the network interface(s) are matched against a large dictionary of patterns to find all instances of (potentially overlapping) matches.  ... 
doi:10.1109/infcom.2010.5462268 dblp:conf/infocom/YangLP10 fatcat:rndxxodunrbvldkerwhy7yp2qq

Robust and Scalable String Pattern Matching for Deep Packet Inspection on Multicore Processors

Yi-Hua E. Yang, Viktor K. Prasanna
2013 IEEE Transactions on Parallel and Distributed Systems  
The H-DFA matches the dictionary up to a predefined prefix length in the same way as AC-DFA, but with a much smaller memory footprint.  ...  The B-NFA extends the matching to full dictionary lengths in a compact variable-stride branch data structure, accelerated by single-instruction multiple-data (SIMD) operations.  ...  String pattern matching (SPM) is the most widely-used pattern matching mechanism used by DPI to match a dictionary of strings against a stream of characters.  ... 
doi:10.1109/tpds.2012.217 fatcat:nqvp5oofwrf4zhtb56swz63vg4

A hardware algorithm for high speed morpheme extraction and its implementation

Toshikazu Fukushima, Yutaka Ohyama, Hitoshi Miyai
1990 Proceedings of the 28th annual meeting on Association for Computational Linguistics -  
This machine can extract morphemes from 10,000 character Japanese text by searching an 80,000 morpheme dictionary in I second.  ...  It can treat multiple text streams, which are composed of character candidates, as well as one text stream.  ...  (a) (b) 0 shows match in a comparator. X shows no match in a comparator. EXTENDED ARCHITECTURE The architecture described in the previous section treats one stream of text string.  ... 
doi:10.3115/981823.981862 dblp:conf/acl/FukushimaOM90 fatcat:mljbfdnccvhbjepoctclsfnkb4

A High-Performance FPGA-Based Implementation of the LZSS Compression Algorithm

Ivan Shcherbakov, Christian Weis, Norbert Wehn
2012 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum  
In this paper we present a flexible high-performance implementation of the LZSS compression algorithm capable of processing up to 50 MB/s on a Virtex-5 FPGA chip.  ...  An efficient way of maximizing the logger performance is doing a real-time compression of the logged stream.  ...  Matching requires comparing the front of the uncompressed stream with several offsets inside the dictionary to find the longest match.  ... 
doi:10.1109/ipdpsw.2012.58 dblp:conf/ipps/ShcherbakovWW12 fatcat:ptg4mvbthvbtlodoqkawjalgha

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams

Shay Golan, Tsvi Kopelowitz, Ely Porat, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
In the dictionary matching problem in the multi-stream model the goal is to preprocess a dictionary D = {P 1 , P 2 , . . . , P d } of d = |D| patterns (strings with maximum length m over alphabet Σ) into  ...  Recently, there has been a growing focus in solving approximate pattern matching problems in the streaming model.  ...  More formally, we introduce the dictionary matching in the multi-stream model that captures this challenge. Dictionary matching in the multi-stream model.  ... 
doi:10.4230/lipics.icalp.2018.65 dblp:conf/icalp/GolanKP18 fatcat:456cwlrdknghrocqtii7lg2ksq

Split-stream dictionary program compression

Steven Lucco
2000 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation - PLDI '00  
This paper describes split-stream dictionary (SSD) compression, a new technique for transforming programs into a compact, interpretable form.  ...  Finally, SSD's two-phased approach to JIT translation enables a virtual machine to provide graceful degradation of program execution time in the face of increasing RAM constraints.  ...  Thanks to William Evans, Jim Gray, and the PLDI 2000 Program Committee for their suggestions in revising earlier drafts of this paper.  ... 
doi:10.1145/349299.349307 dblp:conf/pldi/Lucco00 fatcat:mwwoj4dp45cydlf5igaz6rtxuq

Zips

Hoang Thanh Lam, Toon Calders, Jie Yang, Fabian Mörchen, Dmitriy Fradkin
2013 Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics - IDEA '13  
Therefore, our main contribution is the proposal of a new, streaming algorithm, called Zips, that does not require a seed set of patterns and requires only one scan over the data.  ...  We propose a streaming algorithm, based on the minimal description length (MDL) principle, for extracting non-redundant sequential patterns.  ...  In each step, when the best match of a dictionary word has been found, Zips extends the best match with one extra character and adds this extension to the dictionary.  ... 
doi:10.1145/2501511.2501520 dblp:conf/kdd/LamCYMF13 fatcat:cxn2z7gstzdmljqstahppacliy

Streaming Dictionary Matching with Mismatches

Pawel Gawrychowski, Tatiana Starikovskaya, Michael Wagner
2019 Annual Symposium on Combinatorial Pattern Matching  
In this work, we consider a strictly harder problem called dictionary matching with k mismatches, where we are given a dictionary of d patterns of lengths ≤ m and must find all their k-mismatch occurrences  ...  in the text, and show the first streaming algorithm for it.  ...  a study of dictionary matching with k mismatches in the streaming model of computation.  ... 
doi:10.4230/lipics.cpm.2019.21 dblp:conf/cpm/GawrychowskiS19 fatcat:we43o25ok5d5tpaox5hw6ao4g4

Streaming Over The Internet With A Scalable Parametric Audio Coder

Juan Carlos Cuevas-Martinez, Nicolas Ruiz-Reyes, Pedro Vera-Candeas
2006 Zenodo  
Publication in the conference proceedings of EUSIPCO, Florence, Italy, 2006  ...  Sinusoidal modelling For sinusoidal modelling, we propose the use of matching pursuits with a dictionary of windowed complex exponential functions, instead of a set of windowed sinusoidal functions, in  ...  For example, sinusoidal modelling can be achieved by matching pursuits and a dictionary composed of complex exponentials.  ... 
doi:10.5281/zenodo.53009 fatcat:t4nfq2piejfvzmhbro2mhsnbre
« Previous Showing results 1 — 15 out of 33,585 results