People

ING. MICHAL VORÁČEK, PH.D.

Buryan, P. 2014 Refinement Action-Based Framework for Utilization of Softcomputing in Inductive Learning, detail

Zemanová, M. 2012 Exploiting Ontologies and Higher Order Knowledge in Relational Data Mining, detail

Voráček, M., Vagner, L., Rahman, M.S.R., Iliopoulos, C.I.S. 2010 Finite automata based algorithms on subsequences and supersequences of degenerate strings, detail

Karel, F. 2009 Quantitative Association Rules Mining, detail

Flouri, T., Voráček, M., Vagner, L. 2008 Indexing factors in DNA/RNA Sequences, detail

Voráček, M., Vagner, L., Flouri, T. 2007 Indexing Degenerate Strings, detail

Voráček, M., Vagner, L., Rahman, S.M., Iliopoulos, C.S. 2007 Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata, detail

Voráček, M., Vagner, L., Rahman, S.M., Iliopoulos, C.S. 2007 The Constrained Longest Common Subsequence Problem for Degenerate Strings, detail

Voráček, M. 2007 The Constrained Longest Common Subsequence Problem for Generalized Strings, detail

Voráček, M., Melichar, B. 2006 Computing Seeds in Generalized Strings, detail

Voráček, M., Melichar, B. 2005 Searching for Regularities in Strings using Finite Automata, detail

Voráček, M., Melichar, B. 2005 Searching for Regularities in Generalized Strings using Finite Automata, detail

Voráček, M., Melichar, B., Christodoulakis, M. 2004 Generalized and Weighted Strings: Repetitions and Pattern Matching, detail

Jiřina, M. 1998 Initial Setting of Weights in the Kohonen Maps, detail

Rozinek, J. 1996 Predikce časových řad neuronovými sítěmi, detail