Results 281 to 290 of about 528,172 (313)

PPM with the extended alphabet

Information Sciences, 2006
In the following paper we propose modification of Prediction by Partial Matching (PPM)-a lossless data compression algorithm, which extends an alphabet, used in the PPM method, to long repeated strings. Usually the PPM algorithm's alphabet consists of 256 characters only. We show, on the basis of the Calgary corpus [T.C. Bell, J. Cleary, I.H.
exaly   +2 more sources

Ultra-fast searching assists in evaluating sub-ppm mass accuracy enhancement in U-HPLC/Orbitrap MS data [PDF]

Metabolomics, 2010
A strategy, detailed methodology description and software are given with which the mass accuracy of U-HPLC-Orbitrap data (resolving power 50,000 FWHM) can be enhanced by an order of magnitude to sub-ppm levels.
Arjen Lommen, Arjen Gerssen, Hans G J Mol   +2 more
exaly   +2 more sources

PPM model cleaning

Data Compression Conference, 2003. Proceedings. DCC 2003, 2003
The prediction by partial matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate its probability distribution. Compression ratios yielded by the PPM algorithm have not instigated broader use of this scheme mainly because of its high demand for computational resources. An algorithm that improves the
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak   +2 more
openaire   +1 more source

Multipulse PPM on memoryless channels

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
We examine several properties of n-pulse pulse position modulation (PPM) [H. Sugiyama et al., 1989] on memoryless channels. We derive the maximum likelihood decision rule and an exact expression for the symbol error rate for nges1, generalizing previous results [R.M. Gagliardi et al., 1976, M. Simon et al., 2003].
Hamkins, Jon, Moision, Bruce
openaire   +1 more source

Semicoherent PPM for wideband communications

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
We quantify the impact of coherence on pulse position modulation (PPM) over wideband fading channels by computing achievable rates and an upper bound on uncoded symbol error probability. We study the influence of channel estimation accuracy on the optimum diversity order and furthermore find that a near-optimum receiver typically needs to estimate a ...
Ulrich G. Schuster, Moritz Borgmann, Helmut Bölcskei   +2 more
openaire   +1 more source

PPM-X

2011
Abstract This chapter provides pictures and clinical details of PPM ...
Charles E. Schwartz, Roger E. Stevenson, Tao Wang   +2 more
openaire   +1 more source

PPMexe: PPM for compressing software

Proceedings DCC 2002. Data Compression Conference, 2003
With the emergence of software delivery platforms such as Microsoft's .NET, code compression has become one of the core enabling technologies strongly affecting system performance. We present PPMexe - a set of compression mechanisms for executables that explores their syntax and semantics to achieve superior compression rates.
Milenko Drinic, Darko Kirovski
openaire   +1 more source

Improving the Efficiency of the PPM Algorithm

Problems of Information Transmission, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Extending the PPM branch predictor

14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006
In superscalar architectures, branch prediction techniques are necessary to handle control dependences, boosting the instruction fetch and increasing the number of available useful instructions for parallel execution. Nowadays, most of branch predictors use a kind of table containing branch histories and target addresses.
Zenaide Carvalho da Silva, João Angelo Martini, Ronaldo Augusto Lara Gonçalves   +2 more
openaire   +1 more source