38 search results - page 5 / 8 » Efficient algorithms for fixed-rate entropy-coded vector qua... |
CAIP
2001
Springer
15 years 3 months ago
2001
Springer
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies ...
131
click to vote
BMCBI
2011
14 years 2 months ago
2011
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
CSL
2000
Springer
14 years 11 months ago
2000
Springer
This paper introduces a new form of observation distributions for hidden Markov models (HMMs), combining subvector quantization and mixtures of discrete distrib utions. Despite w...
NIPS
2001
15 years 16 days ago
2001
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
201
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...