A lower bound on compression of unknown alphabets (Q1770393): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127887726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal portfolios with side information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise Minimax Redundancy and Regret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codes for finite sequences of integers drawn from a monotone distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalisation of Stirling's Formula. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to weak universal source coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of universal encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speaking of Infinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Always Good Turing: Asymptotically Optimal Probability Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Compression of Memoryless Sources Over Unknown Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way communication and error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher information and stochastic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Lossless Compression With Unknown Alphabets—The Average Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal sequential coding of single messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-alphabet universal coding of memoryless sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymptotics of certain recurrences arising in universal coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Average-case analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of prediction with expert advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic minimax regret for data compression, gambling, and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision-theoretic extension of stochastic complexity and its applications to learning / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:15, 7 June 2024

scientific article
Language Label Description Also known as
English
A lower bound on compression of unknown alphabets
scientific article

    Statements

    A lower bound on compression of unknown alphabets (English)
    0 references
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    0 references
    Large and unknown alphabets
    0 references
    Patterns
    0 references
    Saddle point approximations
    0 references
    Hayman's theorem
    0 references
    Universal compression
    0 references
    0 references