Search results

  1. 1.
    0577075 - ÚI 2024 RIV CH eng C - Conference Paper (international conference)
    Kůrková, Věra
    Approximation of Binary-Valued Functions by Networks of Finite VC Dimension.
    Artificial Neural Networks and Machine Learning – ICANN 2023. Proceedings, Part I. Cham: Springer, 2023 - (Iliadis, L.; Papaleonidas, A.; Angelov, P.; Jayne, C.), s. 483-490. Lecture Notes in Computer Science, 14254. ISBN 978-3-031-44206-3. ISSN 0302-9743.
    [ICANN 2023: International Conference on Artificial Neural Networks /32./. Heraklion (GR), 26.09.2023-29.09.2023]
    R&D Projects: GA ČR(CZ) GA22-02067S
    Institutional support: RVO:67985807
    Keywords : approximation by neural networks * bounds on approximation errors * VC dimension * growth function * high-dimensional probability * concentration inequalities * method of bounded differences
    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-3-031-44207-0_40
    Permanent Link: https://hdl.handle.net/11104/0346341
     
     
  2. 2.
    0523427 - ÚI 2021 RIV US eng J - Journal Article
    Šileikis, Matas - Warnke, L.
    Upper Tail Bounds for Stars.
    Electronic Journal of Combinatorics. Roč. 27, č. 1 (2020), č. článku P1.67. ISSN 1077-8926. E-ISSN 1077-8926
    R&D Projects: GA ČR GJ16-07822Y; GA ČR(CZ) GJ20-27757Y
    Institutional support: RVO:67985807
    Keywords : Subgraph counts * random graphs * concentration inequalities * upper tail * large deviations
    OECD category: Pure mathematics
    Impact factor: 0.695, year: 2020
    Method of publishing: Open access
    Permanent Link: http://hdl.handle.net/11104/0307782
    FileDownloadSizeCommentaryVersionAccess
    0523427-aoa.pdf4403 KBOA, CC BY-ND 4.0Publisher’s postprintopen-access
     
     
  3. 3.
    0505189 - ÚI 2020 RIV US eng J - Journal Article
    Šileikis, Matas - Warnke, L.
    A counterexample to the DeMarco-Kahn Upper Tail Conjecture.
    Random Structures and Algorithms. Roč. 55, č. 4 (2019), s. 775-794. ISSN 1042-9832. E-ISSN 1098-2418
    R&D Projects: GA ČR GJ16-07822Y
    Institutional support: RVO:67985807
    Keywords : concentration inequalities * large deviations * random graphs * subgraph counts * upper tail
    OECD category: Pure mathematics
    Impact factor: 1.047, year: 2019
    Method of publishing: Limited access
    http://dx.doi.org/10.1002/rsa.20859
    Permanent Link: http://hdl.handle.net/11104/0296681
    FileDownloadSizeCommentaryVersionAccess
    0505189-afin.pdf13549.6 KBPublisher’s postprintrequire
     
     
  4. 4.
    0504155 - ÚI 2020 US eng J - Journal Article
    Dzindzalieta, D. - Juškevičius, Tomas - Šileikis, Matas
    Optimal Probability Inequalities For Random Walks Related to Problems in Extremal Combinatorics.
    SIAM Journal on Discrete Mathematics. Roč. 26, č. 2 (2012), s. 828-837. ISSN 0895-4801. E-ISSN 1095-7146
    Keywords : concentration inequalities * intersecting families * random walks * tail probabilities
    Impact factor: 0.662, year: 2012
    Permanent Link: http://hdl.handle.net/11104/0295850
     
     


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