( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learning Boolean Functions in AC0 on Attribute and Classification Noise.

, , и . ALT, том 3244 из Lecture Notes in Computer Science, стр. 142-155. Springer, (2004)

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.

Takemasa Tomita

Naoko Tomita

Yuto Tomita

 

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

The Worst-Case Time Complexity for Generating All Maximal Cliques., , и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 161-170. Springer, (2004)Clique-based data mining for related genes in a biomedical database., , , и . BMC Bioinform., (2009)Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data., и . IEICE Trans. Inf. Syst., 91-D (6): 1704-1718 (2008)Guest Editors' Foreword., и . J. Graph Algorithms Appl., 20 (1): 1-2 (2016)An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata.. Theor. Comput. Sci., (1984)Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms., , , , и . J. Bioinform. Comput. Biol., 4 (1): 19-42 (2006)An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments., и . J. Glob. Optim., 44 (2): 311 (2009)A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode, , и . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1998)Speeding-Up of Construction Algorithms for the Graph Coloring Problem., , , и . BWCCA, том 159 из Lecture Notes in Networks and Systems, стр. 211-222. Springer, (2020)A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique., , , , , и . FAW, том 9711 из Lecture Notes in Computer Science, стр. 215-226. Springer, (2016)