Results 251 to 260 of about 630,255 (299)
Research on Bamboo Scrimber's Compressive Creep Behaviour Based on Different Kelvin-Voigt Models. [PDF]
Materials (Basel)Miao Z +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Compressive sensing: To compress or not to compress
2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2011In this paper, we consider the compressive sensing scheme from the information theory point of view and derive the lower bound of the probability of error for CS when length N of the information vector is large. The result has been shown that, for an i.i.d.
Davis Kirachaiwanich, Qilian Liang
openaire +1 more source
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
G. Buch +3 more
openaire +1 more source
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 +1 more source
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 +1 more source
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 ...
Andrew V. Goldberg, Michael Sipser
openaire +2 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 ...
Andrew V. Goldberg, Michael Sipser
openaire +2 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.
Sheng Zhong, Qing-Yun Shi, Min-Teh Cheng
openaire +1 more source
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 +2 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 +2 more sources
Journal of Chemical Information and Modeling, 2006
We present a simple and effective method for similarity searching in virtual high-throughput screening, requiring only a string-based representation of the molecules (e.g., SMILES) and standard compression software, available on all modern desktop computers.
James L. Melville +2 more
openaire +2 more sources
We present a simple and effective method for similarity searching in virtual high-throughput screening, requiring only a string-based representation of the molecules (e.g., SMILES) and standard compression software, available on all modern desktop computers.
James L. Melville +2 more
openaire +2 more sources