( en | de | ru )

 

Disambiguation of "Yamamoto, Hiroaki"

Author of the publication

copydeleteadd this publication to your clipboard
Best Possible Algorithms for One-Way Trading with Only the Maximum Fluctuation Ratio Available.

, , and . IEICE Trans. Inf. Syst., 107 (3): 278-285 (2024)

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.

Hiroaki Kobayashi

Hiroaki Tanaka

Masaaki Yamamoto

Shelby Yamamoto

Kenji Yamamoto

 

Other publications of authors with the same name

A new finite automaton construction for regular expressions.. NCMA, volume 304 of books@ocg.at, page 249-264. Österreichische Computer Gesellschaft, (2014)Extraction of characters from color documents., , and . Document Recognition and Retrieval, volume 3967 of SPIE Proceedings, page 278-285. SPIE, (2000)Molecular clouds in the NGC6334 and NGC6357 region, Evidence for a 100 pc-scale cloud-cloud collision triggering the Galactic mini-starbursts, , , , , , , , , and . (Jun 22, 2017)Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 554-565. Springer, (2009)Thermal Tactile Presentation Based on Prediction of Contact Temperature., , , , and . J. Robotics Mechatronics, 18 (3): 226-234 (2006)Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 106 (9): 1100-1110 (September 2023)New finite automata corresponding to semiextended regular expressions.. Syst. Comput. Jpn., 36 (10): 54-61 (2005)A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.. ISAAC, volume 2906 of Lecture Notes in Computer Science, page 158-167. Springer, (2003)Application of the stochastic sampling method to various implicit surfaces., , , , and . Comput. Graph., 25 (3): 441-448 (2001)Algorithm NextFit for the Bin Packing ProblemThis work was supported by JSPS KAKENHI Grant Numbers JP20K11689, JP20K11676, JP16K00033, JP17K00013, JP20K11808, and JP17K00183., , and . Formaliz. Math., 29 (3): 141-151 (2021)