Efficient Parallel Implementations of Kolmogorov Superpositions.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F02%3A06020246" target="_blank" >RIV/67985807:_____/02:06020246 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Efficient Parallel Implementations of Kolmogorov Superpositions.
Original language description
We analyze serial and parallel implementaion of the learning algorithm based on Kolmogorov superposition theorem. Theoretical time complexity estimates are compared and parallel speedup is determined. Practical experiments show that the speedup in the order of 2n, where n is the input dimension, is achievable for the real parallel environments (such as clusters of workstations).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
International Joint Conference on Neural Networks.
ISBN
0-7803-7278-6
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
"X1"-"X5"
Publisher name
IEEE
Place of publication
N/A
Event location
Honolulu [US]
Event date
May 12, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—