Sciweavers

6 search results - page 1 / 2
» Efficient Run-Length Encoding of Binary Sources with Unknown...
Sort
View
DCC
2006
IEEE
14 years 4 months ago
Adaptive Run-Length / Golomb-Rice Encoding of Quantized Generalized Gaussian Sources with Unknown Statistics
We present a simple and efficient entropy coder that combines run-length and Golomb-Rice encoders. The encoder automatically switches between the two modes according to simple rul...
Henrique S. Malvar
TIP
2008
107views more  TIP 2008»
13 years 4 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 4 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
BMCBI
2010
142views more  BMCBI 2010»
13 years 4 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...