يعرض 1 - 20 نتائج من 819 نتيجة بحث عن '"Balík, Miroslav"', وقت الاستعلام: 0.57s تنقيح النتائج
  1. 1
    Academic Journal
  2. 2
    Academic Journal
  3. 3
    Academic Journal
  4. 4
    Academic Journal
  5. 5
    Academic Journal
  6. 6
    Academic Journal
  7. 7
    Academic Journal
  8. 8
    Academic Journal

    المؤلفون: Pfeifer, Václav, Balík, Miroslav

    مصطلحات موضوعية: classifier, comparison, frame-based, phoneme, speech, hierarchical

    وصف الملف: 143718 bytes; application/pdf

    Relation: Advances in electrical and electronic engineering; http://advances.utc.sk/index.php/AEEE/article/download/545/734; Advances in electrical and electronic engineering. 2011, vol. 9, no. 5, p. 243-250.; http://hdl.handle.net/10084/89800

  9. 9
    Electronic Resource
  10. 10
    Conference
  11. 11
    Conference
  12. 12
    Book

    المؤلفون: Balík, Miroslav

    المصدر: Implementation and Application of Automata ; Lecture Notes in Computer Science ; page 233-238 ; ISSN 0302-9743 ; ISBN 9783540403913 9783540449775

  13. 13
    Academic Journal

    المؤلفون: Balík, Miroslav

    وصف الملف: application/pdf

    Relation: mr:MR1899849; zbl:Zbl 1265.68116; reference:[1] Adámek J.: Coding.MVŠT XXXI, SNTL, Prague 1989 (in Czech); reference:[2] Anderson A., Nilson S.: Efficient implementation of suffix trees.Software–Practice and Expirience 25 (1995), 129–141 10.1002/spe.4380250203; reference:[3] Balík M.: String Matching in a Text.Diploma Thesis, CTU, Dept. of Computer Science and Engineering, Prague 1998; reference:[4] Crochemore M., Rytter W.: Text Algorithms.Oxford University Press, New York 1994 Zbl 1078.68151, MR 1307378; reference:[5] Crochemore M., Vérin R.: Direct construction of compact directed acyclic word graphs.In: CPM97 (A. Apostolico and J. Hein, eds., Lecture Notes in Computer Science 1264), Springer–Verlag, Berlin 1997, pp. 116–129 MR 1608404; reference:[6] Gonnet G. H., Baeza–Yates R.: Handbook of Algorithms and Data Structures.Pascal and C. Addison–Wesley, Wokingham 1991 Zbl 0719.68001; reference:[7] Huffman D. A.: A method for construction of minimum redundancy codes.Proc. IRE 40 (1952), 9, 1098–1101; reference:[8] Irving R. W.: Suffix Binary Search Trees, Technical Report TR-1995-7, Computing Science Department, University of Glasgow 199.; reference:[9] Kärkkäinen J.: Suffix cactus: A cross between suffix tree and suffix array.In: Proc. 6th Symposium on Combinatorial Pattern Matching, CPM95, 1995, pp. 191–204 MR 1467515; reference:[10] Kurtz S.: Reducing the Space Requirment of Suffix Trees.Software–Practice and Experience 29 (1999), 13, 1149-1171 10.1002/(SICI)1097-024X(199911)29:133.0.CO;2-O; reference:[11] Melichar B.: Approximate string matching by finite automata.In: Computer Analysis of Images and Patterns (Lecture Notes in Computer Science 970), Springer–Verlag, Berlin 1995; reference:[12] Melichar B.: Fulltext Systems.Publishing House CTU, Prague 1996 (in Czech); reference:[13] Melichar B.: Pattern matching and finite automata.In: Proceedings of the Prague Stringology Club Workshop ’97, Prague 1997

  14. 14
    Electronic Resource
  15. 15
    Electronic Resource
  16. 16
    Electronic Resource
  17. 17
    Electronic Resource
  18. 18
    Electronic Resource
  19. 19
    Conference

    المؤلفون: Balík, Miroslav

    المصدر: Proceedings of the 7th International Conference: Implementation & Application of Automata; 7/ 3/2002, p233-238, 6p

  20. 20
    Dissertation/ Thesis

    المؤلفون: Balík, Miroslav

    المساهمون: Spáčil, Vojtěch

    وصف الملف: 55 l., 4 příl. : il.

    Relation: 200111306 DP; OSD002; http://hdl.handle.net/10084/53199; 141883/11306; ÚK/Sklad diplomových prací