( en | de | ru )

 

Disambiguation of "Hara, Takahiro"

Author of the publication

copydeleteadd this publication to your clipboard
Relation Extraction between Related Concepts by Combining Wikipedia and Web Information for Japanese Language.

, , , , and . AIRS, volume 6458 of Lecture Notes in Computer Science, page 310-319. Springer, (2010)

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.

Takahiro Kato

Sayuri Hara

Takahiro Moriyama

Takeshi Hara

Takahiro Nishiyama

 

Other publications of authors with the same name

Probabilistic semantic similarity measurements for noisy short texts using Wikipedia entities., , , and . CIKM, page 903-908. ACM, (2013)Investigation of children's characteristics for web browsing., , , and . WIDM, page 91-94. ACM, (2009)Quantifying Impact of Mobility on Data Availability in Mobile Ad Hoc Networks.. IEEE Trans. Mob. Comput., 9 (2): 241-258 (2010)Subscription-based data aggregation techniques for top-k monitoring queries., , and . World Wide Web, 20 (2): 237-265 (2017)A measurement study on virtualization overhead for applications of industrial automation systems., , and . ETFA, page 1-8. IEEE, (2016)Space Filling Approach for Distributed Processing of Top-k Dominating Queries., , and . IEEE Trans. Knowl. Data Eng., 30 (6): 1150-1163 (2018)Performance estimation method for virtualized building facilities monitoring applications., , and . ETFA, page 1-8. IEEE, (2017)An Update Propagation Strategy Considering Access Frequency in Peer-to-Peer Networks., , , and . DASFAA, volume 4947 of Lecture Notes in Computer Science, page 661-669. Springer, (2008)SKY R-tree: An Index Structure for Distance-Based Top-k Query., , , and . DASFAA (1), volume 8421 of Lecture Notes in Computer Science, page 220-235. Springer, (2014)Searching K-nearest neighbor nodes based on node density in ad hoc networks., , , and . MoMM, page 199-207. ACM, (2012)