Sciweavers

1282 search results - page 74 / 257
» Practical Loss-Resilient Codes
Sort
View
ITCC
2003
IEEE
15 years 10 months ago
Fast Prefix Code Processing
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
Renato Pajarola
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 10 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
15 years 9 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 5 months ago
Universal Codes as a Basis for Time Series Testing
We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, ba...
Boris Ryabko, Jaakko Astola
AAAI
2011
14 years 5 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...