Results 221 to 230 of about 365,915 (264)
Some of the next articles are maybe not open access.
[1991] Proceedings. Data Compression Conference, 2002
Information services are considered to consist of operations on information objects, which are descriptions of entities, relationships, events, processes, concepts, etc. The operations act on particular representations of an information object. Such operations include the creation of an initial machine usable form R(s), transformations (reversible or ...
Gary Promhouse, M. Bennett
openaire +1 more source
Information services are considered to consist of operations on information objects, which are descriptions of entities, relationships, events, processes, concepts, etc. The operations act on particular representations of an information object. Such operations include the creation of an initial machine usable form R(s), transformations (reversible or ...
Gary Promhouse, M. Bennett
openaire +1 more source
Proceedings of SPE/IADC Drilling Conference, 1999
Abstract Measurement-While-Drilling (MWD) services efficiently support drilling decisions, therefore these tools are becoming a de-facto standard on well sites. Currently, the main drawback of MWD equipment is the absence of a high bit-rate telemetry system to enable real-time activities. This problem may be solved by employing either an
G Bernasconi +3 more
openaire +3 more sources
Abstract Measurement-While-Drilling (MWD) services efficiently support drilling decisions, therefore these tools are becoming a de-facto standard on well sites. Currently, the main drawback of MWD equipment is the absence of a high bit-rate telemetry system to enable real-time activities. This problem may be solved by employing either an
G Bernasconi +3 more
openaire +3 more sources
Data compression of stereopairs
IEEE Transactions on Communications, 1992Two fundamentally different techniques for compressing stereopairs are discussed. The first technique, called disparity-compensated transform-domain predictive coding, attempts to minimize the mean-square error between the original stereopair and the compressed stereopair.
openaire +2 more sources
How to Compress Encrypted Data
2023We study the task of obliviously compressing a vector comprised of n ciphertexts of size ξ bits each, where at most t of the corresponding plaintexts are non-zero. This problem commonly features in applications involving encrypted outsourced storages, such as searchable encryption or oblivious message retrieval.
Nils Fleischhacker +2 more
openaire +3 more sources
Communications of the ACM, 1967
The “information explosion” noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid three-part compressor which can be used with “ any ” body of information to greatly reduce slow external storage requirements and to increase the rate ...
B. A. Marron, Paul A. D. de Maine
openaire +1 more source
The “information explosion” noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid three-part compressor which can be used with “ any ” body of information to greatly reduce slow external storage requirements and to increase the rate ...
B. A. Marron, Paul A. D. de Maine
openaire +1 more source
Data compression with substitution
1989All the data compression methods described in this paper are based on substitutions acting on characters or factors occurring inside the source texts. The average expected compression ratio is often close to 2. Most methods have a bad behaviour when error appears in encoded texts. One bit lost and the decompression is almost impossible!
openaire +2 more sources
Compression as Data Transformation
2007 Data Compression Conference (DCC'07), 2007Summary form only given. Conventional compression techniques exploit general redundancy features in data to compress them. For example, Huffman or Lempel-Ziv techniques compresses data by statistical modeling or string matching while the Burrows-Wheeler Transform simply sorts data by context to improve compressibility. On the other hand, data can often
openaire +1 more source
2003
The Oracle RDBMS recently introduced an innovative compression technique for reducing the size of relational tables. By using a compression algorithm specifically designed for relational data, Oracle is able to compress data much more effectively than standard compression techniques.
Meikel Pöss, Dmitry Potapov
openaire +1 more source
The Oracle RDBMS recently introduced an innovative compression technique for reducing the size of relational tables. By using a compression algorithm specifically designed for relational data, Oracle is able to compress data much more effectively than standard compression techniques.
Meikel Pöss, Dmitry Potapov
openaire +1 more source
1995
This paper compares several, text and image, lossless and lossy, compression techniques for regular gridded elevation data, such as DEMs. Sp_compress and progcode, the best lossless methods average 2.0 bits per point on USGS DEMs, about half the size of gzipped files, and 6.2 bits per point on ETOPO5 samples.
openaire +1 more source
This paper compares several, text and image, lossless and lossy, compression techniques for regular gridded elevation data, such as DEMs. Sp_compress and progcode, the best lossless methods average 2.0 bits per point on USGS DEMs, about half the size of gzipped files, and 6.2 bits per point on ETOPO5 samples.
openaire +1 more source
KDS-transformation for Data Compression
Fundamenta Informaticae, 2005In this paper we present a new simple method to rewrite a given input string into another one which can be more efficiently compressed (in some cases) by traditional compression methods.
openaire +3 more sources