PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Uchida, Tomoyuki"

Author of the publication

copydeleteadd this publication to your clipboard
An Efficient Pattern Matching Algorithm for Ordered Term Tree Patterns.

, , , and . IEICE Transactions, 98-A (6): 1197-1211 (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Uchida, Tomoyuki
add a person with the name Uchida, Tomoyuki
 

Other publications of authors with the same name

Algorithm for Enumerating All Maximal Frequent Tree Patterns among Words in Tree-Structured Documents and Its Application., and . FGIT-DTA, volume 64 of Communications in Computer and Information Science, page 107-114. Springer, (2009)Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents., , , , and . WIRI, page 104-112. IEEE Computer Society, (2005)An Efficient Pattern Matching Algorithm for Ordered Term Tree Patterns., , , and . IEICE Transactions, 98-A (6): 1197-1211 (2015)An Efficient Pattern Matching Algorithm for Unordered Term Tree Patterns of Bounded Dimension., , , , and . IEICE Transactions, 101-A (9): 1344-1354 (2018)Designing Views in HypothesisCreator: System for Assisting in Discovery., , , and . Discovery Science, volume 1721 of Lecture Notes in Computer Science, page 115-127. Springer, (1999)Exact Learning of Finite Unions of Graph Patterns from Queries., , , , and . ALT, volume 4754 of Lecture Notes in Computer Science, page 298-312. Springer, (2007)Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries., , , , and . ALT, volume 2842 of Lecture Notes in Computer Science, page 144-158. Springer, (2003)Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data., , , and . ALT, volume 2533 of Lecture Notes in Computer Science, page 188-202. Springer, (2002)Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data., , , and . ILP, volume 2835 of Lecture Notes in Computer Science, page 347-364. Springer, (2003)Polynomial Time Pattern Matching Algorithm for Ordered Graph Patterns., , , and . ILP, volume 7842 of Lecture Notes in Computer Science, page 86-101. Springer, (2012)