Results 311 to 320 of about 191,871 (348)
Some of the next articles are maybe not open access.
To compress or not to compress?
Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference, 2002For practical communications which transmit finite blocks of source data over noisy channels, we question the common practice to compress (C) the source and then to add redundancy for error control. Rather we exploit the redundancy of the non-compressed source (NC) at the channel decoder by source-controlled channel-decoding. For a simple binary Markov
J. Hagenauer +3 more
openaire +2 more sources
Proceedings of the 3rd international conference on Computer graphics, virtual reality, visualisation and interaction in Africa, 2004
The great advances in the field of 3D scanning technologies have enabled the creation of meshes with hundred millions of polygons. Rendering data sets of that size is time consuming even with commodity graphics hardware. The QSplat technique that has been introduced by S. Rusinkiewics and M.
Namane, Rachid +2 more
openaire +3 more sources
The great advances in the field of 3D scanning technologies have enabled the creation of meshes with hundred millions of polygons. Rendering data sets of that size is time consuming even with commodity graphics hardware. The QSplat technique that has been introduced by S. Rusinkiewics and M.
Namane, Rachid +2 more
openaire +3 more sources
SIAM Journal on Computing, 1985
A notion of language compressibility is defined and it is proved that in a sufficiently sparse and ``easy''-computable language essentially all strings can be compressed efficiently. Similar results hold for a type of optimal compression (ranking). Examples of languages that cannot be compressed/ranked efficiently are also presented, as well as some ...
Michael Sipser, Andrew V. Goldberg
openaire +4 more sources
A notion of language compressibility is defined and it is proved that in a sufficiently sparse and ``easy''-computable language essentially all strings can be compressed efficiently. Similar results hold for a type of optimal compression (ranking). Examples of languages that cannot be compressed/ranked efficiently are also presented, as well as some ...
Michael Sipser, Andrew V. Goldberg
openaire +4 more sources
Compressed sensing of compressible signals
2017 IEEE International Symposium on Information Theory (ISIT), 2017A novel low-complexity robust-to-noise iterative algorithm named compression-based gradient descent (C-GD) algorithm is proposed. C-GD is a generic compressed sensing recovery algorithm, that at its core, employs compression codes, such as JPEG2000 and MPEG4.
Sajjad Beygi +3 more
openaire +2 more sources
2003
Publisher Summary This chapter focuses on compression, which helps the liquid-loading well to increase the gas velocity to equal or exceeds the critical unload velocity and lowers the pressure on the formation for more production by lowering the wellhead flowing pressure.
James F. Lea +2 more
openaire +3 more sources
Publisher Summary This chapter focuses on compression, which helps the liquid-loading well to increase the gas velocity to equal or exceeds the critical unload velocity and lowers the pressure on the formation for more production by lowering the wellhead flowing pressure.
James F. Lea +2 more
openaire +3 more sources
High compression ratio image compression
1993 IEEE International Symposium on Circuits and Systems, 2002An image compression method is proposed. It makes use of the wavelet transform (WT) with better frequency localization and the adaptive hierarchical vector quantization (AHVQ) technique. The WT provides a multifrequency channel representation for the image from which proper coding methods can be drawn.
Min Teh Cheng, Sheng Zhong, Qing-yun Shi
openaire +2 more sources
Compressive Sampling and Lossy Compression
IEEE Signal Processing Magazine, 2008Recent results in compressive sampling have shown that sparse signals can be recovered from a small number of random measurements. This property raises the question of whether random measurements can provide an efficient representation of sparse signals in an information-theoretic sense.
Vivek K Goyal +2 more
openaire +2 more sources
Physics and Chemistry of the Earth, 1968
Methods for the determination of the density of liquids can be divided into three classes as follows. 1. Methods in which the density is measured in terms of the fundamental physical standards of measurement. 2. Methods in which it is measured relative to the density of a reference liquid or solid.
openaire +3 more sources
Methods for the determination of the density of liquids can be divided into three classes as follows. 1. Methods in which the density is measured in terms of the fundamental physical standards of measurement. 2. Methods in which it is measured relative to the density of a reference liquid or solid.
openaire +3 more sources
Philosophy and Phenomenological Research, 2012
Color qualia inversion scenarios have played a key role in various philosophical debates. Most notably perhaps, they have figured in skeptical arguments for the fundamental unknowability of other persons’ color experiences. For these arguments to succeed, it must be assumed that a person's having inverted color qualia may go forever unnoticed.
Igor Douven, Lieven Decock
openaire +2 more sources
Color qualia inversion scenarios have played a key role in various philosophical debates. Most notably perhaps, they have figured in skeptical arguments for the fundamental unknowability of other persons’ color experiences. For these arguments to succeed, it must be assumed that a person's having inverted color qualia may go forever unnoticed.
Igor Douven, Lieven Decock
openaire +2 more sources
Compressibility and consolidation
1995Compressibility and consolidation can be distinguished as: • compressibility — volume changes in a soil when subjected to pressure amounts of settlement • consolidation — rate of volume change with time time to produce a given ...
openaire +2 more sources