Some comparisons of complexity in dictionary-based and linear computational models (Q553254): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q51635113, #quickstatements; #temporary_batch_1710286847436 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.neunet.2010.10.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981815973 / rank | |||
Normal rank | |||
Revision as of 00:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some comparisons of complexity in dictionary-based and linear computational models |
scientific article |
Statements
Some comparisons of complexity in dictionary-based and linear computational models (English)
0 references
26 July 2011
0 references
linear approximation schemes
0 references
variable-basis approximation schemes
0 references
model complexity
0 references
worst-case errors
0 references
neural networks
0 references
kernel models
0 references
