scientific article; zbMATH DE number 756768
From MaRDI portal
Publication:4833659
zbMath0821.68051MaRDI QIDQ4833659
Alistair Moffat, Timothy C. Bell, Ian H. Witten
Publication date: 21 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Information storage and retrieval of data (68P20)
Related Items
Compressed string dictionary search with edit distance one ⋮ Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders ⋮ Compressed matching for feature vectors ⋮ Binary codes for locally homogeneous sequences ⋮ In-place calculation of minimum-redundancy codes ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Grammar compressed sequences with rank/select support ⋮ A simple storage scheme for strings achieving entropy bounds ⋮ Implicit \(B\)-trees: A new data structure for the dictionary problem ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Adaptive text mining: inferring structure from sequences ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ c-trie++: a dynamic trie tailored for fast prefix searches ⋮ Perfect hashing ⋮ Efficient index for retrieving top-\(k\) most frequent documents ⋮ Time series compression based on reinforcement learning ⋮ Location discriminative vocabulary coding for mobile landmark search ⋮ Fast decoding algorithms for variable-lengths codes ⋮ On optimally partitioning a text to improve its compression ⋮ Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series ⋮ Efficient fully-compressed sequence representations ⋮ Compressed data structures: Dictionaries and data-aware measures ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Improved alignment-based algorithm for multilingual text compression ⋮ Computing the longest previous factor ⋮ Spaces, Trees, and Colors ⋮ An experimental study of a compressed index ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ Compact representation of graphs of small clique-width ⋮ Comparison between text compression algorithms in biological sequences ⋮ QoRank: A query-dependent ranking model using LSE-based weighted multiple hyperplanes aggregation for information retrieval ⋮ An adaptive image Euclidean distance ⋮ Mining Compressing Sequential Patterns ⋮ Unnamed Item ⋮ Fast pattern matching in indexed texts ⋮ Repetitions in strings: algorithms and combinatorics ⋮ Bicriteria Data Compression ⋮ Random Access to High-Order Entropy Compressed Text ⋮ Guided blocks WOM codes ⋮ Extensionally defining principles and cases in ethics: an AI model ⋮ Space-efficient substring occurrence estimation
Uses Software
