Compressed matching for feature vectors
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185629 (Why is no real title available?)
- scientific article; zbMATH DE number 1975048 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 756768 (Why is no real title available?)
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Approximate matching of run-length compressed strings
- Approximate string matching on Ziv--Lempel compressed text
- Faster approximate pattern matching in compressed repetitive texts
- Huffman coding with non-sorted frequencies
- Random access to grammar-compressed strings
- Robust universal complete codes for transmission and compression
- Universal codeword sets and representations of the integers
- Wavelet trees for all
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
Cited in
(6)
This page was built for publication: Compressed matching for feature vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294934)