( en | de | ru )

 

Disambiguation of "Takasu, Atsuhiro"

Author of the publication

copydeleteadd this publication to your clipboard
New Algorithms for Unordered Tree Inclusion.

, , , , and . CoRR, (2017)

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 Takasu, Atsuhiro
add a person with the name Takasu, Atsuhiro
 

Other publications of authors with the same name

A Revised Inference for Correlated Topic Model., and . ISNN (2), volume 7952 of Lecture Notes in Computer Science, page 445-454. Springer, (2013)ChronoSAGE: Diversifying Topic Modeling Chronologically., and . WAIM, volume 8485 of Lecture Notes in Computer Science, page 476-479. Springer, (2014)Error Detection of CRF-Based Bibliography Extraction from Reference Strings., , , and . ICADL, volume 7634 of Lecture Notes in Computer Science, page 229-238. Springer, (2012)Three-Way Nonparametric Bayesian Clustering for Handwritten Digit Image Classification., and . ICONIP (3), volume 8228 of Lecture Notes in Computer Science, page 149-156. Springer, (2013)Highly Efficient Parallel Framework: A Divide-and-Conquer Approach., , , and . DEXA (2), volume 9262 of Lecture Notes in Computer Science, page 162-176. Springer, (2015)A System for Exploring Information Spaces., , and . HCI (2), page 759-762. Elsevier, (1997)Empirical evaluation of active sampling for CRF-based analysis of pages., , and . IRI, page 13-18. IEEE Systems, Man, and Cybernetics Society, (2010)Rule Management for Information Extraction from Title Pages of Academic Papers., and . ICPRAM, page 438-444. SciTePress, (2014)Trimming Prototypes of Handwritten Digit Images with Subset Infinite Relational Model., and . MUE, volume 240 of Lecture Notes in Electrical Engineering, page 129-134. Springer, (2013)Top-k query processing for combinatorial objects using Euclidean distance., , and . IDEAS, page 209-213. ACM, (2011)