A linear-time algorithm for computing the multinomial stochastic complexity (Q2379977): 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.ipl.2007.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980971799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum description length principle in coding and modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lambert \(w\) function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recurrence Related to Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling by shortest data description / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher information and stochastic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong optimality of the normalized ML models as universal codes and information in data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822087 / 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: Q4324964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic minimax regret for data compression, gambling, and prediction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:24, 2 July 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for computing the multinomial stochastic complexity
scientific article

    Statements

    A linear-time algorithm for computing the multinomial stochastic complexity (English)
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    0 references