( en | de | ru )

 

Disambiguation of "Arimura, Hiroki"

Author of the publication

copydeleteadd this publication to your clipboard
Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees.

, , and . ICMCS, page 189-195. IEEE, (2016)

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.

Hiroki Takahashi

Hiroki Kawamura

Hiroki Sumizawa

 

Other publications of authors with the same name

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees., and . ILP, volume 3625 of Lecture Notes in Computer Science, page 1-19. Springer, (2005)Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism., and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 68-81. Springer, (2010)Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data.. ISCIS, volume 62 of Lecture Notes in Electrical Engineering, page 353-358. Springer, (2010)Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories., , and . KDIR/KMIS, page 143-151. SciTePress, (2013)Efficient Text Mining with Optimized Pattern Discovery.. CPM, volume 2373 of Lecture Notes in Computer Science, page 17-19. Springer, (2002)Multi-Layered Framework for Modeling Relationships between Biased Objects., , and . SDM, page 819-827. SIAM, (2015)Implementation of sequence BDDs in Erlang., , and . Erlang Workshop, page 90-91. ACM, (2011)Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries., , and . AII/ALT, volume 872 of Lecture Notes in Computer Science, page 317-332. Springer, (1994)Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space., , , , and . CoRR, (2024)Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts., , , , and . Algorithmica, 82 (5): 1346-1377 (2020)