Compression Compression
Martin Isenburg, Unc Ch, Peter Lindstrom Llnl et al. · 2008
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “compression”
Martin Isenburg, Unc Ch, Peter Lindstrom Llnl et al. · 2008
Cited by 0
Mirzaev Abdikhannon · Zenodo (CERN European Organization for Nuclear Research) · 2026
Compression compression is a process associated with the decrease in the volume and settlement of soil layers under the action of external loads, which is especially important when determining deformations under foundations. In our study, compressibility indicators and odometer tests conducted under laboratory conditions were analyzed. Compression properties of various soils (sandy, clay, and loess) were also compared.
Cited by 0Open access
Mirzaev Abdikhannon · Zenodo (CERN European Organization for Nuclear Research) · 2026
Compression compression is a process associated with the decrease in the volume and settlement of soil layers under the action of external loads, which is especially important when determining deformations under foundations. In our study, compressibility indicators and odometer tests conducted under laboratory conditions were analyzed. Compression properties of various soils (sandy, clay, and loess) were also compared.
Cited by 0Open access
LongtaoTang · Zenodo (CERN European Organization for Nuclear Research) · 2025
Codes for the paper "Lossless Set Compression by Binary Tree Coding" in KDD 2025.
Cited by 0Open access
Travis Bauer · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2021
Arithmetic Coding (AC) using Prediction by Partial Matching (PPM) is a compression algorithm that can be used as a machine learning algorithm. This paper describes a new algorithm, NGram PPM. NGram PPM has all the predictive power of AC/PPM, but at a fraction of the computational cost. Unlike compression-based analytics, it is also amenable to a vector space interpretation, which creates the ability for integration with other traditional machine learning algorithms. AC/PPM is reviewed, including its application to machine learning. Then NGram PPM is described and test results are presented, comparing them to AC/PPM.
Cited by 2Open access
A. G. Aksenov, M. D. Churazov · 2011
Cited by 0
LongtaoTang · Zenodo (CERN European Organization for Nuclear Research) · 2025
Codes for the paper "Lossless Set Compression by Binary Tree Coding" in KDD 2025.
Cited by 0Open access
Konstantin Glasman · 2023
Digital communication systems use discrete signals for transmitting messages that take a finite set of values. The need to use discrete signals is determined by the fact that all digital systems have a limited speed and can only work with finite amounts of data presented with finite accuracy. Discrete representation is natural when displaying messages in the form of sequences of discrete characters selected from a finite alphabet. Examples of such discrete messages, called data, are telegrams, letters, number sequences, or machine codes.
Cited by 0
Bulletin of Miscellaneous Information (Royal Gardens Kew)
Cited by 0
Princeton University Press eBooks · 2018
Cited by 0
William F. Schreiber · Springer series in information sciences · 1993
Cited by 0
Elections A to Z · 2003
Cited by 0
2014
Cited by 0
Amit Bhaduri · Springer series in materials science · 2018
Cited by 2
Princeton University Press eBooks · 2012
Cited by 0
A.J. Kidnay, W. Parrish, Daniel G. McCartney · 2019
Cited by 0
Roger H. Brown · 2017
Cited by 1
2006
Cited by 0
Derek Seward · 1994
This chapter is concerned with the design of structural members subjected to compressive forces. A small compression member, such as that in a framed structure, is known as a strut. A larger member, such as the main support for a beam in a building, is known as a column, or more traditionally a stanchion.
Cited by 0
Andrew Currie, Matthew W Cooke · 2007
Cited by 0