Results 11 to 20 of about 58,364 (303)
Compressed Index for Dictionary Matching [PDF]
Data Compression Conference (dcc 2008), 2008 The past few years have witnessed several exciting results on compressed representation of a string T that supports efficient pattern matching, and the space complexity has been reduced to |T| Hk (T) + o (|T| log sigma) bits, where Hk(T) denotes the kth-order empirical entropy of T, and sigma is the size of the alphabet.
Wing-Kai Hon +4 more
core +4 more sources
Universal compressed text indexing [PDF]
Theoretical Computer Science, 2019 The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes based on dictionary compression, a rich and heterogeneous family that exploits text repetitions in different ways. For each such compression scheme, several different indexing solutions have been proposed in the last two decades.
Navarro, Gonzalo, Prezza, Nicola
openaire +7 more sources
Practical Compressed Suffix Trees
Algorithms, 2013 The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for
Gonzalo Navarro +2 more
doaj +2 more sources
The wiener index of the zero-divisor graph for a new class of residue class rings
Frontiers in Chemistry, 2022 The zero-divisor graph of a commutative ring R, denoted by Γ(R), is a graph whose two distinct vertices x and y are joined by an edge if and only if xy = 0 or yx = 0.
Yinhu Wei, Ricai Luo
doaj +1 more source
Compressing relations and indexes [PDF]
Proceedings 14th International Conference on Data Engineering, 2002 We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially effective for records with many low to medium cardinality fields and numeric fields. In addition, this new technique supports very fast decompression.
Jonathan Goldstein +2 more
openaire +1 more source
Lossless Compressed Sensing of Photon Counts for Fast Diffuse Correlation Spectroscopy
IEEE Access, 2022 Diffuse Correlation Spectroscopy (DCS), a noninvasive optical technique, measures deep tissue blood flow using avalanche photon counting modules and data acquisition devices such as FPGAs or correlator boards.
Arindam Biswas, Ashwin B. Parthasarathy
doaj +1 more source
Range Query Method Based on Compressed HMAC Algorithm for Sensor Networks [PDF]
Jisuanji gongcheng, 2021 Traditional range query methods are mainly aimed at one-dimensional data, and require more uploaded information at perception nodes, resulting in high energy consumption.Therefore, a multi-dimensional data range query method for two-layer wireless sensor
HU Qiaomu, DENG Yun
doaj +1 more source
Advances in Materials Science and Engineering, 2023 Compressed stabilized soil block is a sustainable building material primarily made up of stabilized damp soil compressed under pressure. Soil properties and the type of the stabilizer used in producing compressed soil blocks have a significant impact on ...
Besukal Befikadu Zewudie
doaj +1 more source
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017 Generic text-based compression models are simple and fast but there are two issues that needs to be addressed. They cannot leverage the structure that exists in data to achieve better compression and there is an unnecessary decompression step before the
A. Khandelwal, K. S. Rajan
doaj +1 more source
Compressed Indexing for Consecutive Occurrences
CoRR, 2023 The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact occurrence of a given pattern $P$.
Pawel Gawrychowski +3 more
openaire +5 more sources