A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Compressed parameterized pattern matching

2016
*
Theoretical Computer Science
*

In this work, we define the

doi:10.1016/j.tcs.2015.09.015
fatcat:3drdwykatbc4dfuks3kri5bpjm
*compressed*parameterized*pattern**matching*(*compressed*p-*matching*) problem to find all of the p-*matches*between a*pattern*P and text T , using only P and the*compressed*text ... Main Contributions: We formally define the*compressed*parameterized*pattern**matching*(*compressed*p-*matching*) problem to find all of the p-*matches*between a*pattern*P and text T , using only the uncompressed ... Conclusion We formally define the*compressed*parameterized*pattern**matching*(*compressed*p-*matching*) problem to find all of the p-*matches*between the m-length*pattern*P and the n-length text T , using only ...##
###
Compressed Parameterized Pattern Matching

2013
*
2013 Data Compression Conference
*

In this work, we define the

doi:10.1109/dcc.2013.54
dblp:conf/dcc/BealA13
fatcat:qojdw2in2jaurocwgisow4zxve
*compressed*parameterized*pattern**matching*(*compressed*p-*matching*) problem to find all of the p-*matches*between a*pattern*P and text T , using only P and the*compressed*text ... Main Contributions: We formally define the*compressed*parameterized*pattern**matching*(*compressed*p-*matching*) problem to find all of the p-*matches*between a*pattern*P and text T , using only the uncompressed ... Conclusion We formally define the*compressed*parameterized*pattern**matching*(*compressed*p-*matching*) problem to find all of the p-*matches*between the m-length*pattern*P and the n-length text T , using only ...##
###
Compressed Multiple Pattern Matching

2019
*
Annual Symposium on Combinatorial Pattern Matching
*

We describe a

doi:10.4230/lipics.cpm.2019.13
dblp:conf/cpm/KosolobovS19
fatcat:l5vauv573vgwfd7wovrsmbof4e
*compressed*solution for the problem that, provided σ ≤ m δ for a constant δ < 1, works in ) bits of space, for all 0 ≤ k ≤ max{0, α log σ m − 2} simultaneously, where α ∈ (0, 1) is an arbitrary ... We also simplify the construction for practice adapting the fixed block*compression*boosting technique, then implement our data structure, and conduct a number of experiments showing that it is comparable ... C P M 2 0 1 9 13:4*Compressed*Multiple*Pattern**Matching*The main component of the Aho-Corasick data structure is the trie T containing D. ...##
###
Compressed Multiple Pattern Matching
[article]

2019
*
arXiv
*
pre-print

We describe a

arXiv:1811.01248v2
fatcat:qobeglgpqrgsrovfvxy4vf64ey
*compressed*solution for the problem that, provided σ< m^δ for a constant δ < 1, works in O(|T| 1/ε1/ε + occ) time, which is O(|T| + occ) since ε is constant, and occupies mH_k + 1.443 m + ... We also simplify the construction for practice adapting the fixed block*compression*boosting technique, then implement our data structure, and conduct a number of experiments showing that it is comparable ... In this section we describe for this problem the classical Aho-Corasick solution [1] and its space-efficient version developed by Belazzougui [3] . 10:4*Compressed*Multiple*Pattern**Matching*The main ...##
###
Faster fully compressed pattern matching by recompression
[article]

2013
*
arXiv
*
pre-print

In this paper, a fully

arXiv:1111.3244v4
fatcat:ekh5wdcx6zhtrcehih7a4poejq
*compressed**pattern**matching*problem is studied. ... This technique yields an O((n+m)log M) algorithm for*compressed**pattern**matching*, assuming that M fits in O(1) machine words, where n (m) is the size of the*compressed*representation of the text (*pattern*... The commonly investigated problem is the*compressed**pattern**matching*i.e. a*pattern**matching*in which the text is supplied in a*compressed*form. ...##
###
Faster Approximate Pattern Matching in Compressed Repetitive Texts
[article]

2012
*
arXiv
*
pre-print

and

arXiv:1109.2930v4
fatcat:v5awhk7xi5g6vghr2l7xvkifby
*pattern**matching*to the underlying string(s). ... In this paper we give a simple z n-word data structure that takes the same time for substring extraction but only z (m k, k^4 + m) + time for approximate*pattern**matching*. ... In Section 4 we show how to augment the block graph to support fast approximate*pattern**matching*. ...##
###
COMPRESSED PATTERN MATCHING IN JPEG IMAGES

2006
*
International Journal of Foundations of Computer Science
*

We concentrate here on two-dimensional

doi:10.1142/s012905410600442x
fatcat:cprzu3xwkrgbxccicjcydwd26a
*compressed**matching*in which the given encoded text is an n x k pixel image encoded by the standard JPEG baseline scheme and the*pattern*consists of a given x pixel ... Baseline JPEG uses a static Huffman code, without which*compressed**matching*would not always be possible, since our underlying assumption is that all occurrences of the*pattern*are encoded by the same ... The*compressed**matching*starts by encoding the*pattern*using the same JPEG algorithm as the one used for the original image. ...##
###
Compressive Pattern Matching on Multispectral Data

2014
*
IEEE Transactions on Geoscience and Remote Sensing
*

We first adapt this minimization problem to work with

doi:10.1109/tgrs.2014.2314483
fatcat:qdo77qv5jncajkgwh26htnngna
*compressive*sensing data. Then we extend it to perform*pattern*detection using a formal transform called the spectralization along a*pattern*. ... We introduce a new constrained minimization problem that performs template and*pattern*detection on a multispectral image in a*compressive*sensing context. ... By contrast, (a) Giza image (b)*Compressive**pattern**match*- ing, 10% of data (c)*Compressive**pattern**matching*, 20% of data (d)*Compressive**pattern**match*- ing, 30% of data Available at http ...##
###
Pattern-matching and text-compression algorithms

1996
*
ACM Computing Surveys
*

There is no loss of information, the

doi:10.1145/234313.234331
fatcat:l35fbobetbdezblncuj2egwflu
*compression*processes are reversible.*Pattern*-*matching*and text-*compression*algorithms are two important subjects in the wider domain of text processing. ...*PATTERN**MATCHING*When the*pattern*is a single string the problem is known as string*matching*: locate all occurrences of a string x of length m in a text y of length n. ...##
###
Graph Compression Using Pattern Matching Techniques
[article]

2018
*
arXiv
*
pre-print

Our algorithms are based on finding

arXiv:1806.01504v1
fatcat:p5a7u7oy45adlcqbq6sywuoo6m
*patterns*within the adjacency matrix data, and replacing the common*patterns*with specific markers. ... All the techniques proposed here are lossless*compression*of graphs. ... Since the effect of the*compression*methods depend on the number of*patterns*that could be*matched*, we report the values of the*patterns*found. ...##
###
Pattern Matching in LZW Compressed Files

2005
*
IEEE transactions on computers
*

*Compressed*

*pattern*

*matching*is an emerging research area that addresses the following problem: given a text file in

*compressed*format and a

*pattern*, report the occurrence(s) of the

*pattern*in the file ... In this paper, we report our work on

*compressed*

*pattern*

*matching*in LZW

*compressed*files. The work includes an extension of Amir's well-known "almost-optimal" algorithm. ... Thus, multiple

*pattern*

*matching*is not equivalent to performing

*pattern*

*matching*multiple times. ...

##
###
Pattern Matching and Text Compression Algorithms
[chapter]

2014
*
Computing Handbook, Third Edition
*

There is no loss of information, the

doi:10.1201/b16812-18
fatcat:4hclurhe3rfjricyfpxe3bggvq
*compression*processes are reversible.*Pattern*-*matching*and text-*compression*algorithms are two important subjects in the wider domain of text processing. ...*PATTERN**MATCHING*When the*pattern*is a single string the problem is known as string*matching*: locate all occurrences of a string x of length m in a text y of length n. ...##
###
A review on compressed pattern matching

2016
*
Perspectives in Science
*

KEYWORDS

doi:10.1016/j.pisc.2016.06.071
fatcat:7dylh7kearaopfmwt3ks4fzp7e
*Pattern**matching*;*Compressed**pattern**matching*; Wavelet tree; Word based tagged code and big data Summary*Compressed**pattern**matching*(CPM) refers to the task of locating all the occurrences of ... This paper presents a critical review on the recent techniques on the*compressed**pattern**matching*. ... Huffman*compression*based*pattern**matching*This section presents Huffman*compression*and its variation of the text and words. It also presents*pattern**matching*over a Huffman*compressed*text. ...##
###
Beating O(nm) in approximate LZW-compressed pattern matching
[article]

2013
*
arXiv
*
pre-print

Given an LZW/LZ78

arXiv:1308.6509v2
fatcat:lpfh2cc7rfbyblwo5ouxiinsoq
*compressed*text, we want to find an approximate occurrence of a given*pattern*of length m. ... We consider two specific definitions of approximate*matching*, namely the Hamming distance and the edit distance, and show how to achieve O(nm^0.5k^2) and O(nm^0.5k^3) running time, respectively, where ... It is known that exact LZW-*compressed**pattern**matching*can be solved very efficiently [3, 9] , even in the fully*compressed*version, where both the text and the*pattern*are LZW-*compressed*[11] . ...##
###
Mathematics as information compression via the matching and unification of patterns
[article]

2018
*
arXiv
*
pre-print

This paper describes a novel perspective on the foundations of mathematics: how mathematics may be seen to be largely about 'information

arXiv:1808.07004v2
fatcat:zglfhb2novhnrbqn4q2jll6a5q
*compression*via the*matching*and unification of*patterns*' (ICMUP ... These ideas may be seen to be part of a "Big Picture" comprising six areas of interest, with information*compression*as a unifying theme. ... 'information*compression*via the*matching*and unification of*patterns*' is abbreviated as 'ICMUP'. ...
« Previous

*Showing results 1 — 15 out of 273,741 results*