( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Morphological Techniques in the Iterative Closest Point Algorithm.

, , и . ICIP (1), стр. 808-812. IEEE Computer Society, (1998)

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.

Christos Tagarakis

Christos Koutras

Christos Vrettos

Christos Jordanides

Christos Kapnukajas

 

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

Complement for two-way alternating automata., , и . Acta Informatica, 58 (5): 463-495 (2021)Two-Way Automata Characterizations of L/poly Versus NL., и . Theory Comput. Syst., 56 (4): 662-685 (2015)Algorithms and lower bounds in finite automata size complexity.. Massachusetts Institute of Technology, Cambridge, MA, USA, (2006)ndltd.org (oai:dspace.mit.edu:1721.1/37891).Minicomplexity.. DCFS, том 7386 из Lecture Notes in Computer Science, стр. 20-42. Springer, (2012)Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols.. Adventures Between Lower Bounds and Higher Altitudes, том 11011 из Lecture Notes in Computer Science, стр. 33-48. Springer, (2018)From k + 1 to k heads the descriptive trade-off is non-recursive.. DCFS, Report No. 619, стр. 213-224. Department of Computer Science, The University of Western Ontario, Canada, (2004)Non-recursive trade-offs for two-way machines.. Int. J. Found. Comput. Sci., 16 (5): 943-956 (2005)Morphological Techniques in the Iterative Closest Point Algorithm., , и . ICIP (1), стр. 808-812. IEEE Computer Society, (1998)Small Sweeping 2NFAs Are Not Closed Under Complement.. ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 144-156. Springer, (2006)Nondeterminism Is Essential in Small 2FAs with Few Reversals.. ICALP (2), том 6756 из Lecture Notes in Computer Science, стр. 198-209. Springer, (2011)