Hiroaki Yamamoto

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 21

Top Topics

Top Venues

IEICE Trans. Inf. Syst.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

Formaliz. Math.

Publications

Hiroshi Fujiwara, Keiji Hirao, Hiroaki Yamamoto
Best Possible Algorithms for One-Way Trading with Only the Maximum Fluctuation Ratio Available. IEICE Trans. Inf. Syst. 107 (3) (2024)
Hiroshi Fujiwara, Masaya Kawaguchi, Daiki Takizawa, Hiroaki Yamamoto
Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (9) (2023)
Yuichi Ozaki, Sousuke Kanamoto, Hiroaki Yamamoto, Kenichi Kourai
Reliable and Accurate Fault Detection with GPGPUs and LLVM. CLOUD (2023)
Yosuke Obe, Hiroaki Yamamoto, Hiroshi Fujiwara
Parallelization on a Minimal Substring Search Algorithm for Regular Expressions. IEICE Trans. Inf. Syst. 106 (5) (2023)
Hiroshi Fujiwara, Yuichi Shirai, Hiroaki Yamamoto
The Huffman Tree Problem with Upper-Bounded Linear Functions. IEICE Trans. Inf. Syst. (3) (2022)
Hiroaki Yamamoto, Ryosuke Oda, Yoshihiro Wachi, Hiroshi Fujiwara
Substring Searchable Symmetric Encryption Based on an Improved DAWG. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2022)
Hiroshi Fujiwara, Kanaho Hanji, Hiroaki Yamamoto
Online Removable Knapsack Problem for Integer-Sized Unweighted Items. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Hiroshi Fujiwara, Ryota Adachi, Hiroaki Yamamoto
Algorithm NextFit for the Bin Packing ProblemThis work was supported by JSPS KAKENHI Grant Numbers JP20K11689, JP20K11676, JP16K00033, JP17K00013, JP20K11808, and JP17K00183. Formaliz. Math. 29 (3) (2021)
Hiroshi Fujiwara, Ken Endo, Hiroaki Yamamoto
Analysis of Lower Bounds for Online Bin Packing with Two Item Sizes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Hiroaki Yamamoto, Hiroshi Fujiwara
A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions. IEICE Trans. Inf. Syst. (3) (2021)
Hiroshi Fujiwara, Yuta Wanikawa, Hiroaki Yamamoto
Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms. IEICE Trans. Inf. Syst. (3) (2021)
Hiroshi Fujiwara, Hokuto Watari, Hiroaki Yamamoto
Dynamic Programming for the Subset Sum Problem. Formaliz. Math. 28 (1) (2020)
Hiroshi Fujiwara, Kei Shibusawa, Kouki Yamamoto, Hiroaki Yamamoto
Bounds for the Multislope Ski-Rental Problem. IEICE Trans. Inf. Syst. (3) (2020)
Kanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto
Online Removable Knapsack Problems for Integer-Sized Items. TAMC (2020)
Norikazu Takahashi, Daiki Hirata, Shuji Jimbo, Hiroaki Yamamoto
Band-restricted diagonally dominant matrices: Computational complexity and application. J. Comput. Syst. Sci. 101 (2019)
Hiroaki Yamamoto
A faster algorithm for finding shortest substring matches of a regular expression. Inf. Process. Lett. 143 (2019)
Hiroaki Yamamoto, Yoshihiro Wachi, Hiroshi Fujiwara
Space-Efficient and Secure Substring Searchable Symmetric Encryption Using an Improved DAWG. ProvSec (2019)
Yuichi Ozaki, Sousuke Kanamoto, Hiroaki Yamamoto, Kenichi Kourai
Detecting System Failures with GPUs and LLVM. APSys (2019)
Takashi Miyazaki, Yusuke Ohira, Hiroaki Yamamoto, Masaaki Nishi
Teaching Materials Using AR and VR for Learning the Usage of Oscilloscope. AVR (2) (2017)
Ryuji Miyoshi, Hiroaki Yamamoto, Hiroshi Fujiwara, Takashi Miyazaki
Practical and Secure Searchable Symmetric Encryption with a Small Index. NordSec (2017)
Hiroaki Yamamoto
Secure Automata-Based Substring Search Scheme on Encrypted Data. IWSEC (2016)
Hiroaki Yamamoto
A new finite automaton construction for regular expressions. NCMA (2014)
Hiroaki Yamamoto, Daichi Takenouchi
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees. WADS (2009)
Keiichiro Shirai, Masanori Wakabayashi, Masayuki Okamoto, Hiroaki Yamamoto
A Study for High Performance Character Extraction from Color Scene Images. Document Analysis Systems (2008)
Hiroaki Yamamoto, Takashi Miyazaki, Masayuki Okamoto
Bit-Parallel Algorithms for Translating Regular Expressions into NFAs. IEICE Trans. Inf. Syst. (2) (2007)
Hideaki Yokota, Akio Yamamoto, Hiroaki Yamamoto, Toshiro Higuchi
Producing Softness Sensation on an Electrostatic Texture Display for Rendering Diverse Tactile Feelings. WHC (2007)
Akio Yamamoto, Shuichi Nagasawa, Hiroaki Yamamoto, Toshiro Higuchi
Electrostatic Tactile Display with Thin Film Slider and Its Application to Tactile Telepresentation Systems. IEEE Trans. Vis. Comput. Graph. 12 (2) (2006)
Akio Yamamoto, Hiroaki Yamamoto, Benjamin Cros, Hironori Hashimoto, Toshiro Higuchi
Thermal Tactile Presentation Based on Prediction of Contact Temperature. J. Robotics Mechatronics 18 (3) (2006)
Hiroaki Yamamoto
New finite automata corresponding to semiextended regular expressions. Systems and Computers in Japan 36 (10) (2005)
Simon M. Lucas, Alex Panaretos, Luis Sosa, Anthony Tang, Shirley Wong, Robert Young, Kazuki Ashida, Hiroki Nagai, Masayuki Okamoto, Hiroaki Yamamoto, Hidetoshi Miyao, JunMin Zhu, WuWen Ou, Christian Wolf, Jean-Michel Jolion, Leon Todoran, Marcel Worring, Xiaofan Lin
ICDAR 2003 robust reading competitions: entries, results, and future directions. Int. J. Document Anal. Recognit. 7 (2-3) (2005)
Akio Yamamoto, Shuichi Nagasawa, Hiroaki Yamamoto, Toshiro Higuchi
Electrostatic tactile display with thin film slider and its application to tactile tele-presentation systems. VRST (2004)
Hiroaki Yamamoto, Takashi Miyazaki
A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions. COCOON (2003)
Hiroaki Yamamoto
A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem. ISAAC (2003)
Hiroaki Yamamoto
A New Recognition Algorithm for Extended Regular Expressions. ISAAC (2001)
Satoshi Tanaka, Akihiro Shibata, Hiroaki Yamamoto, Hisakiyo Kotsuru
Generalized Stochastic Sampling Method for Visualization and Investigation of Implicit Surfaces. Comput. Graph. Forum 20 (3) (2001)
Satoshi Tanaka, Tomoharu Nakamura, Miharu Ueda, Hiroaki Yamamoto, Kisou Shino
Application of the stochastic sampling method to various implicit surfaces. Comput. Graph. 25 (3) (2001)
Hiroaki Yamamoto
On the Power of Input-Synchronized Alternating Finite Automata. COCOON (2000)
Hiroaki Yamamoto
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions. MFCS (2000)
Satoshi Tanaka, Akio Morisaki, Satoru Nakata, Yasushi Fukuda, Hiroaki Yamamoto
Sampling implicit surfaces based on stochastic differential equations with converging constraint. Comput. Graph. 24 (3) (2000)
Hideo Kasuga, Masayuki Okamoto, Hiroaki Yamamoto
Extraction of characters from color documents. Document Recognition and Retrieval (2000)
Satoshi Tanaka, Yasushi Fukuda, Hiroaki Yamamoto
Stochastic algorithm for detecting intersection of implicit surfaces. Comput. Graph. 24 (4) (2000)
Hideo Kasuga, Hiroaki Yamamoto, Masayuki Okamoto
Color quantization using the fast K-means algorithm. Systems and Computers in Japan 31 (8) (2000)
Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto
Optimal Broadcasting in Almost Trees and Partial k-trees. STACS (1998)
Hiroaki Yamamoto
On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction. Theor. Comput. Sci. 180 (1-2) (1997)
Hiroaki Yamamoto
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines. ICALP (1993)
Hiroaki Yamamoto
Note on the efficiency of methods to generate quasi-random sequences. Systems and Computers in Japan 22 (2) (1991)
Hiroaki Yamamoto, Shoichi Noguchi
Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs Inf. Comput. 75 (2) (1987)
Hiroaki Yamamoto, Shoichi Noguchi
Relationships between time-leaf-and-space bounded ATMS and reversal-and-space bounded NTMs. Systems and Computers in Japan 16 (2) (1985)