Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
DE, IPSJ-DBS |
2018-12-21 16:25 |
Tokyo |
National Institute of Informatics |
Bibliography Extraction from Reference Strings by Bi-directional LSTM-CNN-CRF Daiki Namikoshi, Manabu Ohta (Okayama Univ.), Atsuhiro Takasu, Jun Adachi (NII) DE2018-23 |
The effective use of digital libraries demands maintenance of bibliographic databases. Useful bibliographic information ... [more] |
DE2018-23 pp.17-22 |
DE, CEA |
2016-12-01 15:30 |
Tokyo |
|
A citation intention classification method for academic papers by machine learning Yu Yoshitsugu, Manabu Ohta (Okayama Univ.), Atsuhiro Takasu (NII) DE2016-29 |
[more] |
DE2016-29 pp.45-49 |
MoNA, ASN, IPSJ-MBL, IPSJ-UBI (Joint) [detail] |
2015-03-02 15:40 |
Tokyo |
Shibaura Institute of Technology(Toyosu Campus) |
Proposal of a filtering method for pedestrian positioning using their attribute information Jun Ishii, Hisashi Kurasawa, Hiroshi Sato, Motonori Nakamura (NTT), Atsuhiro Takasu, Kenro Aihara, Jun Adachi (NII) ASN2014-167 |
High-accuracy position estimation systems are needed for providing a service customized for each person based on their p... [more] |
ASN2014-167 pp.181-186 |
DE |
2013-06-22 16:11 |
Tokyo |
ASTUDIO, Aoyama Gakuin Univ. |
Automatic Alignment of Tweets with Research Papers Hikaru Nakahashi, Hidetsugu Nanba, Toshiyuki Takezawa (Hiroshima City Univ.), Atsuhiro Takasu (NII) DE2013-17 |
Recently, participants of academic conferences often post their comments for each research paper (presentation) to Twitt... [more] |
DE2013-17 pp.65-70 |
ITS, IPSJ-ITS, IEE-ITS [detail] |
2012-09-10 11:10 |
Nara |
NAIST |
Automatic Incident Detection Based on Probe Car Data Hiroto Akatsuka (The University of Tokyo), Atsuhiro Takasu, Jun Adachi (NII) ITS2012-15 |
Because traffic incidents cause serious traffic congestion eventually generating economical loss and environmental pollu... [more] |
ITS2012-15 pp.13-18 |
COMP |
2012-06-21 11:00 |
Hokkaido |
Hokkaido University |
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII) COMP2012-15 |
This report presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known ... [more] |
COMP2012-15 pp.25-31 |
DE |
2009-07-28 11:00 |
Hyogo |
Kobe fashion mart |
Maximal Metric Margin Partitioning for Similarity Search Index Hisashi Kurasawa (Univ. of Tokyo), Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi (NII) DE2009-3 |
A fundamental issue that confronts the development of an index for similarity searches in metric spaces is how to divide... [more] |
DE2009-3 pp.13-18 |
COMP |
2009-06-29 14:05 |
Hokkaido |
Hokkaido University |
Approximating Edit Distance of Unordered Trees of Bounded Height Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) COMP2009-22 |
The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation... [more] |
COMP2009-22 pp.31-36 |
COMP |
2008-05-13 15:20 |
Fukuoka |
Kyushu Sangyo University |
Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) COMP2008-13 |
Finding similarities in tree structured data is important for such areas as computational biology, XML databases and ima... [more] |
COMP2008-13 pp.37-42 |
DE |
2006-07-13 10:25 |
Niigata |
HOTEL SENKEI |
Name Disambiguation in Web Search Using Knowledge Base Vu Quang Minh (Univ. of Tokyo), Tomonari Masada, Atsuhiro Takasu, Jun Adachi (NII) |
Results of queries by personal names often contain documents related to several people because of namesake problem. In o... [more] |
DE2006-74 pp.143-148 |
COMP |
2006-05-24 13:00 |
Fukuoka |
Kyushu Institute of Technology |
Approximating Tree Edit Distance Through String Edit Distance Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) |
We present a method to transform an ordered and rooted tree of bounded degree into a string, where it is done by computi... [more] |
COMP2006-12 pp.17-24 |