Search results

  1. 1.
    0556781 - ÚI 2023 RIV SG eng C - Conference Paper (international conference)
    Jiřina, Marcel
    A Criterion for Sorting Reals in a Linear Time.
    Proceedings of Seventh International Congress on Information and Communication Technology. ICICT 2022, London, Volume 4, Volume 4. Singapore: Springer, 2022 - (Yang, X.; Sherratt, S.; Dey, N.; Joshi, A.), s. 437-447. Lecture Notes in Networks and Systems, 465. ISBN 978-981-19-2396-8.
    [ICICT 2022: International Congress on Information and Communication Technology /7./. London / Virtual (GB), 21.02.2022-24.02.2022]
    R&D Projects: GA MŠMT LM2015068
    Institutional support: RVO:67985807
    Keywords : sorting reals * counting sort * time complexity * space complexity
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    https://dx.doi.org/10.1007/978-981-19-2397-5_41
    Permanent Link: http://hdl.handle.net/11104/0330977
     
     
  2. 2.
    0544787 - ÚI 2022 CZ eng V - Research Report
    Jiřina, Marcel
    Nearly All Reals Can Be Sorted with Linear Time Complexity.
    Prague: ICS CAS, 2021. 22 s. Technical Report, V-1285.
    R&D Projects: GA MŠMT LM2015068
    Institutional support: RVO:67985807
    Keywords : sorting * algorithm * real sorting key * time complexity * linear complexity
    Permanent Link: http://hdl.handle.net/11104/0321594
    FileDownloadSizeCommentaryVersionAccess
    0544787-v1285-1.pdf4496.8 KBv.1Otheropen-access
     
     
  3. 3.
    0533287 - ÚI 2021 RIV US eng C - Conference Paper (international conference)
    Jiřina, Marcel
    Customary Behavior of Sorting Reals with Linear Time Complexity.
    Proceedings of 2nd International Conference on Mathematics and Computers in Science and Engineering (MACISE 2020). Piscataway: IEEE, 2020, s. 268-271. ISBN 978-1-7281-6695-7.
    [MACISE 2020: International Conference on Mathematics and Computers in Science and Engineering /2./. Madrid (ES), 18.01.2020-20.01.2020]
    R&D Projects: GA MŠMT LM2015068
    Institutional support: RVO:67985807
    Keywords : sorting algorithm * sorting reals * linear time complexity * countingsort
    OECD category: Computer hardware and architecture
    Permanent Link: http://hdl.handle.net/11104/0311712
     
     
  4. 4.
    0531334 - ÚI 2021 RIV US eng J - Journal Article
    Jiřina, Marcel
    Bounds on Complexity when Sorting Reals.
    International Journal of Circuits, Systems and Signal Processing. Roč. 14, July (2020), s. 276-281. ISSN 1998-4464
    R&D Projects: GA MŠMT LM2015068
    Institutional support: RVO:67985807
    Keywords : Linear time * Sorting reals * Time complexity
    OECD category: Statistics and probability
    Method of publishing: Open access
    Permanent Link: http://hdl.handle.net/11104/0310011
    FileDownloadSizeCommentaryVersionAccess
    0531334-aoa.pdf6905.7 KBOA CC BY 4.0Publisher’s postprintopen-access
     
     
  5. 5.
    0404840 - UIVT-O 20020246 RIV US eng C - Conference Paper (international conference)
    Neruda, Roman
    Efficient Parallel Implementations of Kolmogorov Superpositions.
    International Joint Conference on Neural Networks. IEEE, 2002. ISBN 0-7803-7278-6.
    [IJCNN'02. Honolulu (US), 12.05.2002-17.05.2002]
    R&D Projects: GA AV ČR IAB1030006; GA ČR GA201/02/0428
    Institutional research plan: AV0Z1030915
    Keywords : function approximation * Kolmogorov theorem * time complexity
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125070
     
     
  6. 6.
    0404205 - UIVT-O 20010065 RIV DE eng C - Conference Paper (international conference)
    Neruda, Roman - Štědrý, Arnošt - Drkošová, Jitka
    Implementation of Kolmogorov Learning Algorithm for Feedforward Neural Networks.
    Proceedings. Part II. Berlin: Springer, 2001 - (Alexandrov, V.; Dongarra, J.; Juliano, B.; Renner, R.; Tan, J.), s. 986-995. Lecture Notes in Computer Science, 2074. ISBN 3-540-42233-1. ISSN 0302-9743.
    [International Conference of Computer Science ICCS 2001. San Francisco (US), 28.05.2001-30.05.2001]
    R&D Projects: GA AV ČR IAB1030006; GA AV ČR IAA2030801; GA ČR GA201/99/0092
    Institutional research plan: AV0Z1030915
    Keywords : feedforward neural networks * Kolmogorov theorem * time complexity
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0124471
     
     
  7. 7.
    0313655 - ÚI 2009 SIGLE CZ eng V - Research Report
    Šámalová, Terezie - Šámal, R.
    Pruning Algorithms for One-hidden-layer Feedforward Neural Networks.
    Prague: ICS AS CR, 2008. 32 s. Technical Report, V-1022.
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : probabilistic algorithm * randomized pruning * error estimate * time complexity * regularization * kernel methods
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0164403
    FileDownloadSizeCommentaryVersionAccess
    v1022-08.pdf9358.4 KBOtheropen-access
     
     


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.