( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
MDL learning of unions of simple pattern languages from positive examples.

, , и . EuroCOLT, том 904 из Lecture Notes in Computer Science, стр. 252-260. Springer, (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Esko Horn

Herbert Eskötter

Esko Unger

Esko Juuso

Marjatta Eskola

 

Другие публикации лиц с тем же именем

Design and implementation of a string database query language., , , , и . Inf. Syst., 28 (4): 311-337 (2003)Term Frequency-Based Identification of FAQ-Articles., и . CoLIS, Benja Publishing, Lokve, Croatia, (1999)On the Optimal Assignment of Attribute to Passes in Multi-pass Attribute Evaluators, и . 7th Int. Coll. on Automata, Languages and Programming, том 85 из Lecture Notes in Computer Science, Springer-Verlag, New York--Heidelberg--Berlin, Noordwijkerhout.(июля 1980)Correlating gene promoters and expression in gene disruption experiments., , , и . ECCB, стр. 172-180. (2002)The Computational Complexity of Orientation Search in Cryo-Electron Microscopy., , и . International Conference on Computational Science, том 3036 из Lecture Notes in Computer Science, стр. 231-238. Springer, (2004)Lower Bounds on the Size of Deterministic Parsers.. J. Comput. Syst. Sci., 26 (2): 153-170 (1983)A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings., и . Theor. Comput. Sci., (1988)Maximal and minimal representations of gapped and non-gapped motifs of a string.. Theor. Comput. Sci., 410 (43): 4341-4349 (2009)Longest common substrings with k mismatches., , , и . CoRR, (2014)LALR(k) Testing is PSPACE-Complete, и . STOC, стр. 202-206. ACM, (1981)