Skip header Section
Skip Bibliometrics Section
Text compressionJanuary 1990
- Authors:
- Timothy C. Bell,
- John G. Cleary,
- Ian H. Witten
Abstract
No abstract available.
Cited By
- Rahman M and Hamada M (2023). A prediction-based lossless image compression procedure using dimension reduction and Huffman coding, Multimedia Tools and Applications, 82:3, (4081-4105), Online publication date: 1-Jan-2023.
- Jordon L and Moser P A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78 SOFSEM 2021: Theory and Practice of Computer Science, (389-399)
Moffat A (2019). Huffman Coding, ACM Computing Surveys, 52:4, (1-35), Online publication date: 31-Jul-2020.- Zheng J, Rau P and Zhao J Quantification of Natural Multimodal Interaction Capacity Cross-Cultural Design. User Experience of Products, Services, and Intelligent Environments, (269-283)
- Hossein S, De D and Das Mohapatra P (2019). DNA sequence compression using RP/GP2 method with information storage and security, Microsystem Technologies, 26:7, (2159-2172), Online publication date: 1-Jul-2020.
- Gagie T, He M and Navarro G (2020). Compressed Dynamic Range Majority and Minority Data Structures, Algorithmica, 82:7, (2063-2086), Online publication date: 1-Jul-2020.
- Yamamoto H, Imaeda K, Hashimoto K and Iwata K A Universal Data Compression Scheme based on the AIVF Coding Techniques 2020 IEEE International Symposium on Information Theory (ISIT), (2360-2364)
- Concone F, Re G and Morana M (2019). A Fog-Based Application for Human Activity Recognition Using Personal Smart Devices, ACM Transactions on Internet Technology, 19:2, (1-20), Online publication date: 31-May-2019.
- Chairungsee S and Crochemore M Longest Previous Non-overlapping Factors Table Computation Combinatorial Optimization and Applications, (483-491)
- Lin M, Inoue N and Shinoda K CTC Network with Statistical Language Modeling for Action Sequence Recognition in Videos Proceedings of the on Thematic Workshops of ACM Multimedia 2017, (393-401)
- Grossi R, Iacono J, Navarro G, Raman R and Satti S (2017). Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries, ACM Transactions on Algorithms, 13:2, (1-31), Online publication date: 29-May-2017.
- Avila B and Campello de Souza R (2017). Meta-Fibonacci Codes, IEEE Transactions on Information Theory, 63:4, (2357-2375), Online publication date: 1-Apr-2017.
- Al-Kazaz N, Irvine S and Teahan W An Automatic Cryptanalysis of Transposition Ciphers Using Compression Cryptology and Network Security, (36-52)
- Burroughs N (2016). Register allocation and spilling using the expected distance heuristic, Software—Practice & Experience, 46:11, (1499-1523), Online publication date: 1-Nov-2016.
- Norimatsu J, Yasuhara M, Tanaka T and Yamamoto M (2016). A Fast and Compact Language Model Implementation Using Double-Array Structures, ACM Transactions on Asian and Low-Resource Language Information Processing, 15:4, (1-27), Online publication date: 2-Jun-2016.
- Aronica S, Langiu A, Marzi F, Mazzola S, Mignosi F and Nazzicone G Compressing Big Data Revised Selected Papers of the 6th International Conference on Mathematical Aspects of Computer and Information Sciences - Volume 9582, (285-289)
- Rough D, Vertanen K and Kristensson P An evaluation of Dasher with a high-performance language model as a gaze communication method Proceedings of the 2014 International Working Conference on Advanced Visual Interfaces, (169-176)
- Navarro G and Thankachan S Faster Top-k Document Retrieval in Optimal Space Proceedings of the 20th International Symposium on String Processing and Information Retrieval - Volume 8214, (255-262)
- Garcia S, Rodrigues J, Santos S, Pratas D, Afreixo V, Bastos C, Ferreira P and Pinho A (2013). A Genomic Distance for Assembly Comparison Based on Compressed Maximal Exact Matches, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:3, (793-798), Online publication date: 1-May-2013.
- Cánovas R and Moffat A Practical compression for multi-alignment genomic files Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135, (51-60)
- Badkobeh G, Crochemore M and Toopsuwan C Computing the maximal-exponent repeats of an overlap-free string in linear time Proceedings of the 19th international conference on String Processing and Information Retrieval, (61-72)
- Paihama J, Williams K and Suleman H Assessing the design of web interoperability protocols Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, (353-362)
- Yamaguchi H and Tanaka-Ishii K Text segmentation by language using minimum description length Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1, (969-978)
- Crochemore M, Giambruno L, Langiu A, Mignosi F and Restivo A (2012). Dictionary-symbolwise flexible parsing, Journal of Discrete Algorithms, 14, (74-90), Online publication date: 1-Jul-2012.
- Pratas D and Pinho A On the detection of unknown locally repeating patterns in images Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I, (158-165)
- Yuang C, Banchs R and Siong C An empirical evaluation of stop word removal in statistical machine translation Proceedings of the Joint Workshop on Exploiting Synergies between Information Retrieval and Machine Translation (ESIRMT) and Hybrid Approaches to Machine Translation (HyTra), (30-37)
- Iritani M and Yokota H Effects on performance and energy reduction by file relocation based on file-access correlations Proceedings of the 2012 Joint EDBT/ICDT Workshops, (79-86)
- Fariña A, Brisaboa N, Navarro G, Claude F, Places Á and Rodríguez E (2012). Word-based self-indexes for natural language text, ACM Transactions on Information Systems, 30:1, (1-34), Online publication date: 1-Feb-2012.
- Pinho A, Pratas D and Garcia S Complexity profiles of DNA sequences using finite-context models Proceedings of the 7th conference on Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society: information Quality in e-Health, (75-82)
- Badkobeh G, Chairungsee S and Crochemore M Hunting redundancies in strings Proceedings of the 15th international conference on Developments in language theory, (1-14)
- Anagnostopoulos T, Anagnostopoulos C and Hadjiefthymiades S (2011). An adaptive location prediction model based on fuzzy control, Computer Communications, 34:7, (816-834), Online publication date: 1-May-2011.
- Pinho A, Garcia S, Ferreira P, Afreixo V, Bastos C, Neves A and Rodrigues J Exploring homology using the concept of three-state entropy vector Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics, (161-170)
- Bonny T and Henkel J (2010). Huffman-based code compression techniques for embedded processors, ACM Transactions on Design Automation of Electronic Systems, 15:4, (1-37), Online publication date: 1-Sep-2010.
- Nguyen T, Pham T and Tran D A method for Vietnamese text normalization to improve the quality of speech synthesis Proceedings of the 1st Symposium on Information and Communication Technology, (78-85)
- Gupta A and Agarwal S (2010). Partial retrieval of compressed semi-structured documents, International Journal of Computer Applications in Technology, 38:4, (239-249), Online publication date: 1-Aug-2010.
- Al-Bahadili H, Al-Saab S, Naoum R and Hussain S A web search engine model based on index-query bit-level compression Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications, (1-7)
- Ilijašic L and Saitta L Long-tailed distributions in grid complex network Proceedings of the 2nd workshop on Grids meets autonomic computing, (21-30)
- Ahuja A and Downey D Improved extraction assessment through better language models Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (225-228)
- Papadopoulos K and Papaefstathiou I (2010). Titan-R, ACM Transactions on Reconfigurable Technology and Systems, 3:2, (1-25), Online publication date: 1-May-2010.
- Crochemore M and Lecroq T Text data compression algorithms Algorithms and theory of computation handbook, (14-14)
- Yang L, Dick R, Lekatsas H and Chakradhar S (2010). Online memory compression for embedded systems, ACM Transactions on Embedded Computing Systems, 9:3, (1-30), Online publication date: 1-Feb-2010.
- Lin M and Chang Y (2009). A new architecture of a two-stage lossless data compression and decompression algorithm, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 17:9, (1297-1303), Online publication date: 1-Sep-2009.
- Grailu H, Lotfizad M and Sadoghi-Yazdi H (2009). 1-D chaincode pattern matching for compression of Bi-level printed farsi and arabic textual images, Image and Vision Computing, 27:10, (1615-1625), Online publication date: 1-Sep-2009.
- Bhattacharjee B, Lim L, Malkemus T, Mihaila G, Ross K, Lau S, McArthur C, Toth Z and Sherkat R (2009). Efficient index compression in DB2 LUW, Proceedings of the VLDB Endowment, 2:2, (1462-1473), Online publication date: 1-Aug-2009.
- Bonny T and Henkel J LICT Proceedings of the 46th Annual Design Automation Conference, (903-906)
- Amir A, Aumann Y, Levy A and Roshko Y Quasi-distinct Parsing and Optimal Compression Methods Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577, (12-25)
- Germann U, Joanis E and Larkin S Tightly packed tries Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing, (31-39)
- Umemura K and Church K Substring Statistics Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing, (53-71)
- Tryfonopoulos C, Koubarakis M and Drougas Y (2009). Information filtering and query indexing for an information retrieval model, ACM Transactions on Information Systems, 27:2, (1-47), Online publication date: 1-Feb-2009.
- Navarro G (2009). Implementing the LZ-index, ACM Journal of Experimental Algorithmics, 13, (1.2-1.49), Online publication date: 1-Feb-2009.
- Askitis N and Zobel J (2009). B-tries for disk-based string management, The VLDB Journal — The International Journal on Very Large Data Bases, 18:1, (157-179), Online publication date: 1-Jan-2009.
- Bonny T and Henkel J (2008). Efficient code compression for embedded processors, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16:12, (1696-1707), Online publication date: 1-Dec-2008.
- Mahoui M, Teahan W, Thirumalaiswamy Sekhar A and Chilukuri S Identification of gene function using prediction by partial matching (PPM) language models Proceedings of the 17th ACM conference on Information and knowledge management, (779-786)
- Kitakami M and Okura T (2008). Dependability Improvement for PPM Compressed Data by Using Compression Pattern Matching, IEICE - Transactions on Information and Systems, E91-D:10, (2435-2439), Online publication date: 1-Oct-2008.
- Florêncio D and Herley C One-Time Password Access to Any Server without Changing the Server Proceedings of the 11th international conference on Information Security, (401-420)
- Ifrim G, Bakir G and Weikum G Fast logistic regression for text categorization with variable-length n-grams Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, (354-362)
- Al-Bahadili H (2008). A novel lossless data compression scheme based on the error correcting Hamming codes, Computers & Mathematics with Applications, 56:1, (143-150), Online publication date: 1-Jul-2008.
- Mäkinen V and Navarro G (2008). Dynamic entropy-compressed sequences and full-text indexes, ACM Transactions on Algorithms, 4:3, (1-38), Online publication date: 1-Jun-2008.
- Lu H and Yeh C (2008). Balanced parentheses strike back, ACM Transactions on Algorithms, 4:3, (1-13), Online publication date: 1-Jun-2008.
- Bonny T and Henkel J Instruction re-encoding facilitating dense embedded code Proceedings of the conference on Design, automation and test in Europe, (770-775)
- Moura E, Santos C, Araujo B, Silva A, Calado P and Nascimento M (2008). Locality-Based pruning methods for web search, ACM Transactions on Information Systems, 26:2, (1-28), Online publication date: 1-Mar-2008.
- Legg S and Hutter M (2007). Universal Intelligence, Minds and Machines, 17:4, (391-444), Online publication date: 1-Dec-2007.
- Mäkinen V and Navarro G (2007). Rank and select revisited and extended, Theoretical Computer Science, 387:3, (332-347), Online publication date: 20-Nov-2007.
- Fenwick P (2007). Burrows–Wheeler compression, Theoretical Computer Science, 387:3, (200-219), Online publication date: 20-Nov-2007.
- Adiego J, Martínez-Prieto M and De La Fuente P Edge-guided natural language text compression Proceedings of the 14th international conference on String processing and information retrieval, (14-25)
- Casey K, Ertl M and Gregg D (2007). Optimizing indirect branch prediction accuracy in virtual machine interpreters, ACM Transactions on Programming Languages and Systems, 29:6, (37-es), Online publication date: 1-Oct-2007.
- Lin C, Xie Y and Wolf W (2007). Code compression for VLIW embedded systems using a self-generating table, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 15:10, (1160-1171), Online publication date: 1-Oct-2007.
- Gross M and Voegeli C (2007). Technical Section, Computers and Graphics, 31:5, (761-777), Online publication date: 1-Oct-2007.
- Bonny T and Henkel J Instruction splitting for efficient code compression Proceedings of the 44th annual Design Automation Conference, (646-651)
- Bonny T and Henkel J Efficient code density through look-up table compression Proceedings of the conference on Design, automation and test in Europe, (809-814)
- Navarro G and Mäkinen V (2007). Compressed full-text indexes, ACM Computing Surveys, 39:1, (2-es), Online publication date: 12-Apr-2007.
- Askitis N and Sinha R HAT-trie Proceedings of the thirtieth Australasian conference on Computer science - Volume 62, (97-105)
- Legg S and Hutter M Tests of machine intelligence 50 years of artificial intelligence, (232-242)
- Gopalratnam K and Cook D (2007). Online Sequential Prediction via Incremental Parsing, IEEE Intelligent Systems, 22:1, (52-58), Online publication date: 1-Jan-2007.
- Konstantopoulos C, Gavalas D and Pantziou G A mobility aware technique for clustering on mobile ad-hoc networks Proceedings of the 8th international conference on Distributed Computing and Networking, (397-408)
- Begleiter R and El-Yaniv R (2006). Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition, The Journal of Machine Learning Research, 7, (379-411), Online publication date: 1-Dec-2006.
- Song L, Kotz D, Jain R and He X (2006). Evaluating Next-Cell Predictors with Extensive Wi-Fi Mobility Data, IEEE Transactions on Mobile Computing, 5:12, (1633-1649), Online publication date: 1-Dec-2006.
- Gutwin C, Fedak C, Watson M, Dyck J and Bell T Improving network efficiency in real-time groupware with general message compression Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work, (119-128)
- Sadler C and Martonosi M Data compression algorithms for energy-constrained devices in delay tolerant networks Proceedings of the 4th international conference on Embedded networked sensor systems, (265-278)
- Gilbert J and Abrahamson D Adaptive object code compression Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems, (282-292)
- Adiego J and de la Fuente P Mapping words into codewords on PPM Proceedings of the 13th international conference on String Processing and Information Retrieval, (181-192)
- Lin M, Lee J and Jan G (2006). A lossless data compression and decompression algorithm and its hardware architecture, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 14:9, (925-936), Online publication date: 1-Sep-2006.
- Zhang D and Lee W Extracting key-substring-group features for text classification Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (474-483)
- Wang S, Chen C and Chang R Optimizing code size for embedded real-time applications Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing, (297-307)
- Zobel J and Moffat A (2006). Inverted files for text search engines, ACM Computing Surveys, 38:2, (6-es), Online publication date: 25-Jul-2006.
- Jin Z and Tanaka-Ishii K Unsupervised segmentation of Chinese text by use of branching entropy Proceedings of the COLING/ACL on Main conference poster sessions, (428-435)
- González R and Navarro G Statistical encoding of succinct data structures Proceedings of the 17th Annual conference on Combinatorial Pattern Matching, (294-305)
- Brisaboa N, Fariña A, Navarro G and Paramá J Improving semistatic compression via pair-based coding Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics, (124-134)
- Waldman I and Pinter S Profile-driven compression scheme for embedded systems Proceedings of the 3rd conference on Computing frontiers, (95-104)
- Xie Y, Wolf W and Lekatsas H (2006). Code compression for embedded VLIW processors using variable-to-fixed coding, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 14:5, (525-536), Online publication date: 1-May-2006.
- Lakhani G (2006). Reducing coding redundancy in LZW, Information Sciences: an International Journal, 176:10, (1417-1434), Online publication date: 1-May-2006.
- Eslambolchilar P and Murray-Smith R Model-Based, multimodal interaction in document browsing Proceedings of the Third international conference on Machine Learning for Multimodal Interaction, (1-12)
- Bonny T and Henkel J Using Lin-Kernighan algorithm for look-up table compression to improve code density Proceedings of the 16th ACM Great Lakes symposium on VLSI, (259-265)
- Skibiński P (2006). PPM with the extended alphabet, Information Sciences: an International Journal, 176:7, (861-874), Online publication date: 1-Apr-2006.
- Cook D, Youngblood M and Das S A multi-agent approach to controlling a smart environment Designing Smart Homes, (165-182)
- López-Ortiz A, Mirzazadeh M, Safari M and Sheikhattar H (2005). Fast string sorting using order-preserving compression, ACM Journal of Experimental Algorithmics, 10, (1.4-es), Online publication date: 31-Dec-2005.
- Tanaka-Ishii K Entropy as an indicator of context boundaries Proceedings of the Second international joint conference on Natural Language Processing, (93-105)
- Lauther U and Lukovszki T Space efficient algorithms for the burrows-wheeler backtransformation Proceedings of the 13th annual European conference on Algorithms, (293-304)
- Adiego J, De la Fuente P and Navarro G Combining Structural and Textual Contexts for Compressing Semistructured Databases Proceedings of the Sixth Mexican International Conference on Computer Science, (68-73)
- Brisaboa N, Fariña A, Navarro G and Paramá J Compressing dynamic text collections via phrase-based coding Proceedings of the 9th European conference on Research and Advanced Technology for Digital Libraries, (462-474)
- Hashempour H and Lombardi F (2005). Application of Arithmetic Coding to Compression of VLSI Test Data, IEEE Transactions on Computers, 54:9, (1166-1177), Online publication date: 1-Sep-2005.
- Brisaboa N, Fariña A, Navarro G and Paramá J Efficiently decodable and searchable natural language adaptive compression Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, (234-241)
- Lekatsas H, Henkel J and Wolf W (2005). Approximate arithmetic coding for bus transition reduction in low power designs, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 13:6, (696-707), Online publication date: 1-Jun-2005.
- de Moura E, dos Santos C, Fernandes D, Silva A, Calado P and Nascimento M Improving Web search efficiency via a locality based static pruning method Proceedings of the 14th international conference on World Wide Web, (235-244)
- Cormode G and Muthukrishnan S Substring compression problems Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (321-330)
- Janson S, Lonardi S and Szpankowski W (2004). On average sequence complexity, Theoretical Computer Science, 326:1-3, (213-227), Online publication date: 20-Oct-2004.
- Rueda L and Oommen B On families of new adaptive compression algorithms suitable for time-varying source data Proceedings of the Third international conference on Advances in Information Systems, (234-244)
- Sun B, Yu F, Wu K and Leung V Mobility-based anomaly detection in cellular mobile networks Proceedings of the 3rd ACM workshop on Wireless security, (61-69)
- Diao Y, Rizvi S and Franklin M Towards an internet-scale XML dissemination service Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (612-623)
- Sornil O and Chaiwanarom P Combining prediction by partial matching and logistic regression for Thai word segmentation Proceedings of the 20th international conference on Computational Linguistics, (1208-es)
- Cachin C (2004). An information-theoretic model for steganography, Information and Computation, 192:1, (41-56), Online publication date: 1-Jul-2004.
- Alfonseca M (2004). A boundless compression algorithm in APL2, ACM SIGAPL APL Quote Quad, 34:3, (26-30), Online publication date: 1-Jun-2004.
- Xu X, Clarke C and Jones S High performance code compression architecture for the embedded ARM/THUMB processor Proceedings of the 1st conference on Computing frontiers, (451-456)
- Benini L, Menichelli F and Olivieri M (2004). A Class of Code Compression Schemes for Reducing Power Consumption in Embedded Microprocessor Systems, IEEE Transactions on Computers, 53:4, (467-482), Online publication date: 1-Apr-2004.
- Tsou B, Lai T and Chow K Comparing entropies within the chinese language Proceedings of the First international joint conference on Natural Language Processing, (466-475)
- Lin C, Xie Y and Wolf W LZW-Based Code Compression for VLIW Embedded Systems Proceedings of the conference on Design, automation and test in Europe - Volume 3
- Beszédes Á, Ferenc R, Gyimóthy T, Dolenc A and Karsisto K (2003). Survey of code-size reduction methods, ACM Computing Surveys, 35:3, (223-267), Online publication date: 1-Sep-2003.
- Tanaka-Ishii K, Hayakawa D and Takeichi M Acquiring vocabulary for predictive text entry through dynamic reuse of a small user corpus Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1, (407-414)
- Lyon C, Nehaniv C, Warren S, Dickerson B and Baillie J Homophony and disambiguation through sequential processes in the evolution of language Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence, (315-324)
- Ertl M and Gregg D Optimizing indirect branch prediction accuracy in virtual machine interpreters Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, (278-288)
- Núñez J and Jones S (2003). Gbit/s lossless data compression hardware, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 11:3, (499-510), Online publication date: 1-Jun-2003.
- Kärkkäinen J, Navarro G and Ukkonen E (2003). Approximate string matching on Ziv-Lempel compressed text, Journal of Discrete Algorithms, 1:3-4, (313-338), Online publication date: 1-Jun-2003.
- Peng F, Schuurmans D and Wang S Language and task independent text categorization with simple language models Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1, (110-117)
- Ertl M and Gregg D (2003). Optimizing indirect branch prediction accuracy in virtual machine interpreters, ACM SIGPLAN Notices, 38:5, (278-288), Online publication date: 9-May-2003.
- Brisaboa N, Iglesias E, Navarro G and Paramá J An efficient compression code for text databases Proceedings of the 25th European conference on IR research, (468-481)
- Peng F and Schuurmans D Combining naive bayes and n-gram language models for text classification Proceedings of the 25th European conference on IR research, (335-350)
- Peng F, Schuurmans D, Wang S and Keselj V Language independent authorship attribution using character level language models Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1, (267-274)
- Karri R and Mishra P (2003). Optimizing the energy consumed by secure wireless sessions, Mobile Networks and Applications, 8:2, (177-185), Online publication date: 1-Apr-2003.
- Atallah M and Lonardi S Authentication of LZ-77 compressed data Proceedings of the 2003 ACM symposium on Applied computing, (282-287)
- Shieber S and Baker E Abbreviated text input Proceedings of the 8th international conference on Intelligent user interfaces, (293-296)
- Cheng C, Jain R and van den Berg E Location prediction algorithms for mobile wireless systems Wireless internet handbook, (245-263)
- Afrati F, Leiß H and de Rougemont M (2003). Definability and Compression, Fundamenta Informaticae, 56:1-2, (155-180), Online publication date: 1-Jan-2003.
- Cohn A, Magee D, Galata A, Hogg D and Hazarika S Towards an architecture for cognitive vision using qualitative spatio-temporal representations and abduction Spatial cognition III, (232-248)
- Bell T Data compression Encyclopedia of Computer Science, (492-496)
- Afrati F, Leiß H and de Rougemont M (2002). Definability and compression, Fundamenta Informaticae, 56:1,2, (155-180), Online publication date: 1-Oct-2002.
- Burger J, Henderson J and Morgan W Statistical named entity recognizer adaptation proceedings of the 6th conference on Natural language learning - Volume 20, (1-4)
- Tanaka-Ishii K, Inutsuka Y and Takeichi M Entering text with a four-button device Proceedings of the 19th international conference on Computational linguistics - Volume 1, (1-7)
- Adjeroh D, Zhang Y, Mukherjee A, Powell M and Bell T DNA Sequence Compression Using the Burrows-Wheeler Transform Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Lekatsas H, Henkel J and Jakkula V Design of an one-cycle decompression hardware for performance increase in embedded systems Proceedings of the 39th annual Design Automation Conference, (34-39)
- Watanabe T, Sugawara K and Sugihara H (2002). A New Pattern Representation Scheme Using Data Compression, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:5, (579-590), Online publication date: 1-May-2002.
- Crochemore M, Landau G and Ziv-Ukelson M A sub-quadratic sequence alignment algorithm for unrestricted cost matrices Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (679-688)
- Matias Y, Rajpoot N and Sahinalp C (2001). The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression, ACM Journal of Experimental Algorithmics, 6, (10-es), Online publication date: 31-Dec-2002.
- Xie Y, Wolf W and Lekatsas H A code decompression architecture for VLIW processors Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture, (66-75)
- Pérez-Ortiz J, Calera-Rubio J and Forcada M (2001). Online Text Prediction with Recurrent Neural Networks, Neural Processing Letters, 14:2, (127-140), Online publication date: 1-Oct-2001.
- Lekatsas H, Henkel J and Wolf W Design and simulation of a pipelined decompression architecture for embedded systems Proceedings of the 14th international symposium on Systems synthesis, (63-68)
- Navarro G, Kida T, Takeda M, Shinohara A and Arikawa S Faster Approximate String Matching over Compressed Text Proceedings of the Data Compression Conference
- Rizzo F and Storer J Overlap in Adaptive Vector Quantization Proceedings of the Data Compression Conference
- Ahn E, Yoo S and Kang S Effective algorithms for cache-level compression Proceedings of the 11th Great Lakes symposium on VLSI, (89-92)
- Chiang Y, Lin C and Lu H Orderly spanning trees with applications to graph encoding and graph drawing Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (506-515)
- Ward D, Blackwell A and MacKay D Dasher—a data entry interface using continuous gestures and language models Proceedings of the 13th annual ACM symposium on User interface software and technology, (129-137)
- Buldas A, Laud P and Lipmaa H Accountable certificate management using undeniable attestations Proceedings of the 7th ACM conference on Computer and Communications Security, (9-17)
- Zhifang S, Jun Z and Wu D An information-theory-based feature type analysis for the modelling of statistical parsing Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, (472-479)
- Lin K and Wu C (2000). A Low-Power CAM Design for LZ Data Compression, IEEE Transactions on Computers, 49:10, (1139-1145), Online publication date: 1-Oct-2000.
- Balkenhol B and Kurtz S (2000). Universal Data Compression Based on the Burrows-Wheeler Transformation, IEEE Transactions on Computers, 49:10, (1043-1053), Online publication date: 1-Oct-2000.
- Teahan W, McNab R, Wen Y and Witten I (2000). A compression-based algorithm for Chinese word segmentation, Computational Linguistics, 26:3, (375-393), Online publication date: 1-Sep-2000.
- Afrati F, Leiβ H and Michel de Rougemont Definability and Compression Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Lekatsas H, Henkel J and Wolf W Code compression for low power embedded system design Proceedings of the 37th Annual Design Automation Conference, (294-299)
- Liefke H and Suciu D (2000). XMill, ACM SIGMOD Record, 29:2, (153-164), Online publication date: 1-Jun-2000.
- Liefke H and Suciu D XMill Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (153-164)
- Lekatsas H, Henkel J and Wolf W Code compression as a variable in hardware/software co-design Proceedings of the eighth international workshop on Hardware/software codesign, (120-124)
- Teahan W Text classification and segmentation using minimum cross-entropy Content-Based Multimedia Information Access - Volume 2, (943-961)
- Effros M PPM Performance with BWT Complexity Proceedings of the Conference on Data Compression
- Reznik Y and Szpankowski W On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol Proceedings of the Conference on Data Compression
- de Agostino S Work-Optimal Parallel Decoders for LZ2 Data Compression Proceedings of the Conference on Data Compression
- Lekatsas H, Wolf W and Henkel J Arithmetic Coding for Low Power Embedded System Design Proceedings of the Conference on Data Compression
- Chi C Multi-Lingual Cascading Text Compressors for WWW Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
- Nagumo H, Lu M and Watson K (1999). Parallel Parsing Algorithms for Static Dictionary Compression, IEEE Transactions on Parallel and Distributed Systems, 10:12, (1241-1251), Online publication date: 1-Dec-1999.
- Centoducatte P, Araujo G and Pannain R Compressed Code Execution on DSP Architectures Proceedings of the 12th international symposium on System synthesis
- Vanhoof B, Peón M, Lafruit G, Bormans J, Nachtergaele L and Bolsens I (1999). A Scalable Architecture for MPEG-4 Wavelet Quantization, Journal of VLSI Signal Processing Systems, 23:1, (93-107), Online publication date: 1-Oct-1999.
- Pereira F and Singer Y (1999). An Efficient Extension to Mixture Techniques for Prediction and Decision Trees, Machine Language, 36:3, (183-199), Online publication date: 1-Sep-1999.
- Bhattacharya A and Das S LeZi-update Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, (1-12)
- Sazeides Y and Smith J (1999). Limits of Data Value Predictability, International Journal of Parallel Programming, 27:4, (229-256), Online publication date: 1-Aug-1999.
- Wilson P, Kaplan S and Smaragdakis Y The case for compressed caching in virtual memory systems Proceedings of the annual conference on USENIX Annual Technical Conference, (8-8)
- Fan L, Cao P, Lin W and Jacobson Q (1999). Web prefetching between low-bandwidth clients and proxies, ACM SIGMETRICS Performance Evaluation Review, 27:1, (178-187), Online publication date: 1-Jun-1999.
- Fraser C (1999). Automatic inference of models for statistical code compression, ACM SIGPLAN Notices, 34:5, (242-246), Online publication date: 1-May-1999.
- Fraser C Automatic inference of models for statistical code compression Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (242-246)
- Fan L, Cao P, Lin W and Jacobson Q Web prefetching between low-bandwidth clients and proxies Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (178-187)
- Bradley Q, Horspool R and Vitek J JAZZ Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
- Araujo G, Centoducatte P, Cartes M and Pannain R Code compression based on operand factorization Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture, (194-201)
- Andersson A and Nilsson S (1998). Implementing radixsort, ACM Journal of Experimental Algorithmics, 3, (7-es), Online publication date: 1-Sep-1998.
- Jung B and Burleson W (1998). Efficient VLSI for Lempel-Ziv compression in wireless data communication networks, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 6:3, (475-483), Online publication date: 1-Sep-1998.
- Lyon C and Hewitt J The value of minimal prosodic information in spoken language corpora Proceedings of the Workshop on Partially Automated Techniques for Transcribing Naturally Occurring Continuous Speech, (40-48)
- Lekatsas H and Wolf W Code compression for embedded systems Proceedings of the 35th annual Design Automation Conference, (516-521)
- Schmerler S, Tanurhan Y and Müller-Glaser K Advanced optimistic approaches in logic simulation Proceedings of the conference on Design, automation and test in Europe, (362-369)
- Sazeides Y and Smith J The predictability of data values Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture, (248-258)
- Lefurgy C, Bird P, Chen I and Mudge T Improving code density using compression techniques Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture, (194-203)
- Johansen P (1997). Adaptive Pattern Recognition, Journal of Mathematical Imaging and Vision, 7:4, (325-339), Online publication date: 1-Oct-1997.
- Cleary J, McWha J and Pearson M (1997). Timestamp representations for virtual sequences, ACM SIGSIM Simulation Digest, 27:1, (98-105), Online publication date: 1-Jul-1997.
- Nevill-Manning C, Witten I and Paynter G Browsing in digital libraries Proceedings of the second ACM international conference on Digital libraries, (230-236)
- Cleary J, McWha J and Pearson M Timestamp representations for virtual sequences Proceedings of the eleventh workshop on Parallel and distributed simulation, (98-105)
- Ernst J, Evans W, Fraser C, Proebsting T and Lucco S (1997). Code compression, ACM SIGPLAN Notices, 32:5, (358-365), Online publication date: 1-May-1997.
- Ernst J, Evans W, Fraser C, Proebsting T and Lucco S Code compression Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, (358-365)
- Tate S (1997). Band Ordering in Lossless Compression of Multispectral Images, IEEE Transactions on Computers, 46:4, (477-483), Online publication date: 1-Apr-1997.
- Ng W and Ravishankar C (1997). Block-Oriented Compression Techniques for Large Statistical Databases, IEEE Transactions on Knowledge and Data Engineering, 9:2, (314-328), Online publication date: 1-Mar-1997.
- Bachrach R and El-Yaniv R Online list accessing algorithms and their applications Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (53-62)
- Jansson P and Jeuring J PolyP—a polytypic programming language extension Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (470-482)
- Chen I, Coffey J and Mudge T (1996). Analysis of branch prediction via data compression, ACM SIGOPS Operating Systems Review, 30:5, (128-137), Online publication date: 1-Dec-1996.
- Chen I, Coffey J and Mudge T Analysis of branch prediction via data compression Proceedings of the seventh international conference on Architectural support for programming languages and operating systems, (128-137)
- Chen I, Coffey J and Mudge T (1996). Analysis of branch prediction via data compression, ACM SIGPLAN Notices, 31:9, (128-137), Online publication date: 1-Sep-1996.
- Kroeger T and Long D Predicting file system actions from prior events Proceedings of the 1996 annual conference on USENIX Annual Technical Conference, (26-26)
- Bhattacharjee S, Bhattacharya J, Raghavendra U, Saha D and Pal Chaudhuri P A VLSI architecture for cellular automata based parallel data compression Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
- Ney H, Essen U and Kneser R (1995). On the Estimation of 'Small' Probabilities by Leaving-One-Out, IEEE Transactions on Pattern Analysis and Machine Intelligence, 17:12, (1202-1212), Online publication date: 1-Dec-1995.
- Hatton E SAMC - efficient semi-adaptive data compression Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
- Klein S Efficient recompression techniques for dynamic full-text retrieval systems Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, (39-47)
- Danskin J, Albanese A, Davis G and Jensen P Multimedia backroads (panel) Proceedings of the third ACM international conference on Multimedia, (213-214)
- Stauffer L and Hirschberg D (1995). Systolic Self-Organizing Lists Under Transpose, IEEE Transactions on Parallel and Distributed Systems, 6:1, (102-105), Online publication date: 1-Jan-1995.
- Cleary J, Irvine S and Rinsma-Melchert I (1995). Refereed paper, Computers and Security, 14:2, (167-180), Online publication date: 1-Jan-1995.
- Rau H and Skiena S Dialing for documents Proceedings of the 7th annual ACM symposium on User interface software and technology, (147-155)
- Danskin J Higher Bandwidth X Proceedings of the second ACM international conference on Multimedia, (89-96)
- Iyer B and Wilhite D Data Compression Support in Databases Proceedings of the 20th International Conference on Very Large Data Bases, (695-704)
- Curewitz K, Krishnan P and Vitter J (1993). Practical prefetching via data compression, ACM SIGMOD Record, 22:2, (257-266), Online publication date: 1-Jun-1993.
- Curewitz K, Krishnan P and Vitter J Practical prefetching via data compression Proceedings of the 1993 ACM SIGMOD international conference on Management of data, (257-266)
- Church K and Mercer R (1993). Introduction to the special issue on computational linguistics using large corpora, Computational Linguistics, 19:1, (1-24), Online publication date: 1-Mar-1993.
- Thomborson C (1992). The V.42bis Standard for Data-Compressing Modems, IEEE Micro, 12:5, (41-53), Online publication date: 1-Sep-1992.
- Brown P, Pietra V, Mercer R, Pietra S and Lai J (1992). An estimate of an upper bound for the entropy of English, Computational Linguistics, 18:1, (31-40), Online publication date: 1-Mar-1992.
- Fox E (1991). Standards and the emergence of digital multimedia systems, Communications of the ACM, 34:4, (26-29), Online publication date: 1-Apr-1991.
- Lelewer D and Ng C (1991). An honors course in data compression, ACM SIGCSE Bulletin, 23:1, (146-150), Online publication date: 1-Mar-1991.
- Lelewer D and Ng C An honors course in data compression Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (146-150)
- Fiala E and Greene D (1989). Data compression with finite windows, Communications of the ACM, 32:4, (490-505), Online publication date: 1-Apr-1989.
Index Terms
- Text compression
Recommendations
Dictionary design for text image compression with JBIG2
The JBIG2 standard for lossy and lossless bilevel image coding is a very flexible encoding strategy based on pattern matching techniques. This paper addresses the problem of compressing text images with JBIG2. For text image compression, JBIG2 allows ...
Boosting Text Compression with Word-Based Statistical Encoding1
Semistatic word-based byte-oriented compressors are known to be attractive alternatives to compress natural language texts. With compression ratios around 30–35%, they allow fast direct searching of compressed text. In this article, we reveal that these ...