Results 21 to 30 of about 291,521 (282)
Subpath Queries on Compressed Graphs: A Survey
Algorithms, 2021 Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time ...
Nicola Prezza
doaj +1 more source
Corrections to Scaling in the Integer Quantum Hall Effect [PDF]
, 1993 Finite size corrections to scaling laws in the centers of Landau levels are studied systematically by numerical calculations. The corrections can account for the apparent non-universality of the localization length exponent $\nu{}$.
Huckestein, Bodo
core +1 more source
Cone index after mechanized harvesting of sugarcane in the North Fluminense
Vértices, 2014 This study aimed at evaluating the cone index, in depths of 0 to 0.3 m after mechanized harvesting of green sugarcane using the harvester Case A8800 and Case A4000 in the North-Fluminense region of Rio de Janeiro State.
Carmen Maria Coimbra Manhães +4 more
doaj +1 more source
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.
Tam, SL +4 more
openaire +2 more sources
Future Internet, 2021 During transmission of digital images, secret messages can be embedded using data hiding techniques. Such techniques can transfer private secrets without drawing the attention of eavesdroppers.
Chin-Chen Chang +3 more
doaj +1 more source
Modular Decomposition-Based Graph Compression for Fast Reachability Detection
Data Science and Engineering, 2019 Fast reachability detection is one of the key problems in graph applications. Most of the existing works focus on creating an index and answering reachability based on that index.
Shikha Anirban +2 more
doaj +1 more source
String Indexing with Compressed Patterns
ACM Transactions on Algorithms, 2023 Given a string S of length n , the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries. In this article, we consider the basic variant where the pattern is given in compressed form and the ...
Philip Bille +2 more
openaire +7 more sources
On Optimally Partitioning Variable-Byte Codes [PDF]
, 2019 The ubiquitous Variable-Byte encoding is one of the fastest compressed representation for integer sequences. However, its compression ratio is usually not competitive with other more sophisticated encoders, especially when the integers to be compressed ...
Pibiri, Giulio Ermanno +1 more
core +2 more sources
Experimental Study on Measuring Petzval Image Plane of Streak Tube with Single Image
Photonics, 2023 In the process of image reconstruction of compressed sensing algorithms, building a measurement matrix related to the parameters of the imaging system is necessary to improve its imaging quality.
Houzhi Cai +5 more
doaj +1 more source
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes [PDF]
, 2008 Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression ...
Aouiche, Kamel +2 more
core +2 more sources