86
Voted
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
110
click to vote
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
Abstract--We study the entropy rate of pattern sequences of stochastic processes, and its relationship to the entropy rate of the original process. We give a complete characterizat...
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
95
Voted
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
We describe a domain-independent, unsupervised algorithm for refined segmentation of time series data into meaningful episodes, focusing on the problem of text segmentation. The V...
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
71
Voted
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
103
click to vote
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
When losses occur in a transmission of compressed video, the decoder can attempt to conceal the loss by using spatial or temporal methods to estimate the missing macroblocks. We c...
114
Voted
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
101
click to vote
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
We use the abbreviations tet and tri for tetrahedron and triangle. TetStreamer encodes a Delaunay tet mesh in a back-to-front visibility order and streams it from a server to a cl...
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE