Search results

  1. 1.
    0411027 - UTIA-B 20030014 RIV HU eng C - Conference Paper (international conference)
    Horvath, L. - Hušková, Marie
    Kernel type estimators for gradual changes.
    Budapest: Janos Bolyai Mathematical Society, 2002. In: Limit Theorems in Probability and Statistics. - (Berkes, I.; Csaki, E.; Csorgo, M.), s. 175-187
    [Limit Theorems in Probability and Statistics. Balatonlelle (HU), 28.06.1999-02.07.1999]
    R&D Projects: GA ČR GA201/97/1163
    Institutional research plan: CEZ:AV0Z1075907
    Keywords : Kernel type estimators * gradual changes
    Subject RIV: BB - Applied Statistics, Operational Research
    Permanent Link: http://hdl.handle.net/11104/0131114
     
     
  2. 2.
    0403389 - UIVT-O 980049 RIV DE eng C - Conference Paper (international conference)
    Klaschka, Jan - Siciliano, R. - Antoch, J.
    Computational Enhancements in Tree-Growing Methods.
    Advances in Data Science and Classification. Berlin: Springer, 1998 - (Rizzi, A.; Vichi, M.; Bock, H.), s. 295-302. ISBN 3-540-64641-8.
    [IFCS-98 /6./. Roma (IT), 21.07.1998-24.07.1998]
    R&D Projects: GA ČR GA201/97/1163
    Grant - others:MŽP(CZ) ZZ/520/2/97
    Program: ZZ
    Keywords : classification and regression trees * computational cost * auxiliary statistics * fast splitting algorithm
    Subject RIV: BB - Applied Statistics, Operational Research
    Permanent Link: http://hdl.handle.net/11104/0123699
     
     
  3. 3.
    0403031 - UIVT-O 970094 IT eng C - Conference Paper (international conference)
    Antoch, J. - Klaschka, Jan - Machek, J. - Straka, F.
    Prediction of Failures That Have Never Occured - Weibull Case.
    8. International Symposium on Applied Stochastic Models and Data Analysis. The Ins and Outs of Solving Real Problems. Napoli: Rocco Curto Editore, 1997, s. 25-30.
    [ASMDA 97. Anacapri (IT), 11.06.1997-14.06.1997]
    R&D Projects: GA ČR GA201/97/1163; GA ČR GA102/96/0183
    Permanent Link: http://hdl.handle.net/11104/0123396
     
     


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