On the computational complexity of approximating distributions by probabilistic automata (Q1207305): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:31, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of approximating distributions by probabilistic automata |
scientific article |
Statements
On the computational complexity of approximating distributions by probabilistic automata (English)
0 references
1 April 1993
0 references
PAC learning model
0 references
density estimation
0 references
Kullback-Leibler divergence
0 references
hidden Markov models
0 references
speech recognition
0 references
computational learning theory
0 references
