Results 281 to 290 of about 293,454 (315)

Compression by model combination

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002
In the probabilistic framework for data compression, a model of the probability distribution of a data source is constructed, and the predicted probability is entropy coded. To achieve better compression, most traditional methods resort to higher order models.
openaire   +1 more source

Speech Recognition Model Compression

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020
Deep Neural Network-based speech recognition systems are widely used in most speech processing applications. To achieve better model robustness and accuracy, these networks are constructed with millions of parameters, making them storage and compute-intensive. In this paper, we propose Bin & Quant (B&Q), a compression technique using which we were able
Madhumitha Sakthi, Ahmed H. Tewfik, Raj Pawate   +2 more
openaire   +1 more source

Local Modeling for WebGraph Compression

2010 Data Compression Conference, 2010
We describe a simple hierarchical scheme for webgraph compression, which supports efficient in-memory and from-disk decoding of page neighborhoods, for neighborhoods defined for both incoming and outgoing links. The scheme is highly competitive in terms of both compression effectiveness and decoding speed.
Vo Ngoc Anh, Alistair Moffat
openaire   +1 more source

Model based concordance compression

Data Compression Conference, 1992., 2003
The authors discuss concordance compression using the framework now customary in compression theory. They begin by creating a mathematical model of concordance generation, and then use optimal compression engines, such as Huffman or arithmetic coding, to do the actual compression. It should be noted that in the context of a static information retrieval
Abraham Bookstein, Shmuel T. Klein, Timo Raita   +2 more
openaire   +1 more source

3D model compression in MPEG

2008 15th IEEE International Conference on Image Processing, 2008
3D polygonal mesh is the most commonly used representation for 3D graphic models. Compact and compressed representation of the 3D mesh is the major functionality of MPEG 3D mesh compression technologies. 3D mesh coding (3 DMC) in MPEG was first standardized in 2000 with the achievement of compression ratio of more than 40 times with reasonable quality.
Eun-Young Chang, Namho Hur, Euee S. Jang
openaire   +1 more source

Predictive modeling in XML compression

2007 2nd International Conference on Digital Information Management, 2007
Since its advent, the Extensible Markup Language (XML) has gained tremendous popularity in many different application areas. However, XML data is generally very verbose and redundant, and thus it requires a lot of disk space to store and bandwidth to transfer. To overcome this problem, many methods for compressing XML documents have been proposed.
Olli Luoma, Jukka Teuhola
openaire   +1 more source

On the Compression of Markov Prediction Model

Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), 2007
Markov prediction model is the basis of Web prefetching and personalized recommendation. The existence of a large amount of Web objects results in a vast increase in the number of states which represent the users visited transfer behavior, which also causes the problem of huge spatial complexity in prediction model.
Lei Shi 0001, Yao Yao, Lin Wei
openaire   +1 more source

Oldroyd Model for Compressible Fluids

Journal of Mathematical Sciences, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Modelling Chinese For Text Compression

Data Compression Conference, 2005
Summary form only given. We have adapted the PPM model especially for Chinese text and achieve good compression results. We highlighted the importance of pre-processing work for Chinese, as unlike naturally segmented languages such as English, it is not clear what are the most appropriate symbols to use for encoding.
Peiliang Wu, William John Teahan
openaire   +1 more source

Learning Compressible Models

Proceedings of the 2010 SIAM International Conference on Data Mining, 2010
Yi Zhang 0010, Jeff G. Schneider, Artur Dubrawski   +2 more
openaire   +1 more source