Hiroaki Yamamoto - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 48 from 48

2024

Best Possible Algorithms for One-Way Trading with Only the Maximum Fluctuation Ratio AvailableHiroshi Fujiwara, Keiji Hirao, Hiroaki Yamamoto. ieicetd, 107(3):278-285, 2024. [doi]

2023

2022

Online Removable Knapsack Problem for Integer-Sized Unweighted ItemsHiroshi Fujiwara, Kanaho Hanji, Hiroaki Yamamoto. ieiceta, 105-A(9):1195-1202, September 2022. [doi]

The Huffman Tree Problem with Upper-Bounded Linear FunctionsHiroshi Fujiwara, Yuichi Shirai, Hiroaki Yamamoto. ieicetd, 105(3):474-480, 2022. [doi]

Substring Searchable Symmetric Encryption Based on an Improved DAWGHiroaki Yamamoto, Ryosuke Oda, Yoshihiro Wachi, Hiroshi Fujiwara. ieiceta, 105-A(12):1578-1590, December 2022. [doi]

2021

2020

Dynamic Programming for the Subset Sum ProblemHiroshi Fujiwara, Hokuto Watari, Hiroaki Yamamoto. fm, 28(1):89-92, 2020. [doi]

Bounds for the Multislope Ski-Rental ProblemHiroshi Fujiwara, Kei Shibusawa, Kouki Yamamoto, Hiroaki Yamamoto. ieicet, 103-D(3):481-488, 2020. [doi]

Online Removable Knapsack Problems for Integer-Sized ItemsKanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto. tamc 2020: 82-93 [doi]

2019

2017

Teaching Materials Using AR and VR for Learning the Usage of OscilloscopeTakashi Miyazaki, Yusuke Ohira, Hiroaki Yamamoto, Masaaki Nishi. avr 2017: 43-52 [doi]

Practical and Secure Searchable Symmetric Encryption with a Small IndexRyuji Miyoshi, Hiroaki Yamamoto, Hiroshi Fujiwara, Takashi Miyazaki. nordsec 2017: 53-69 [doi]

2016

Secure Automata-Based Substring Search Scheme on Encrypted DataHiroaki Yamamoto. IWSEC 2016: 111-131 [doi]

2014

A new finite automaton construction for regular expressionsHiroaki Yamamoto. ncma 2014: 249-264

2009

Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled TreesHiroaki Yamamoto, Daichi Takenouchi. wads 2009: 554-565 [doi]

2008

A Study for High Performance Character Extraction from Color Scene ImagesKeiichiro Shirai, Masanori Wakabayashi, Masayuki Okamoto, Hiroaki Yamamoto. das 2008: 293-298 [doi]

2007

Bit-Parallel Algorithms for Translating Regular Expressions into NFAsHiroaki Yamamoto, Takashi Miyazaki, Masayuki Okamoto. ieicet, 90-D(2):418-427, 2007. [doi]

Producing Softness Sensation on an Electrostatic Texture Display for Rendering Diverse Tactile FeelingsHideaki Yokota, Akio Yamamoto, Hiroaki Yamamoto, Toshiro Higuchi. haptics 2007: 584-585 [doi]

2006

Thermal Tactile Presentation Based on Prediction of Contact TemperatureAkio Yamamoto, Hiroaki Yamamoto, Benjamin Cros, Hironori Hashimoto, Toshiro Higuchi. jrm, 18(3):226-234, 2006. [doi]

Electrostatic Tactile Display with Thin Film Slider and Its Application to Tactile Telepresentation SystemsAkio Yamamoto, Shuichi Nagasawa, Hiroaki Yamamoto, Toshiro Higuchi. tvcg, 12(2):168-177, 2006. [doi]

2005

2004

Electrostatic tactile display with thin film slider and its application to tactile tele-presentation systemsAkio Yamamoto, Shuichi Nagasawa, Hiroaki Yamamoto, Toshiro Higuchi. vrst 2004: 209-216 [doi]

2003

A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching ProblemHiroaki Yamamoto. isaac 2003: 158-167 [doi]

A Fast Bit-Parallel Algorithm for Matching Extended Regular ExpressionsHiroaki Yamamoto, Takashi Miyazaki. cocoon 2003: 222-231 [doi]

2001

Generalized Stochastic Sampling Method for Visualization and Investigation of Implicit SurfacesSatoshi Tanaka, Akihiro Shibata, Hiroaki Yamamoto, Hisakiyo Kotsuru. cgf, 20(3):359-367, 2001.

Application of the stochastic sampling method to various implicit surfacesSatoshi Tanaka, Tomoharu Nakamura, Miharu Ueda, Hiroaki Yamamoto, Kisou Shino. cg, 25(3):441-448, 2001. [doi]

A New Recognition Algorithm for Extended Regular ExpressionsHiroaki Yamamoto. isaac 2001: 257-267 [doi]

2000

Color quantization using the fast K-means algorithmHideo Kasuga, Hiroaki Yamamoto, Masayuki Okamoto. scjapan, 31(8):33-40, 2000. [doi]

Extraction of characters from color documentsHideo Kasuga, Masayuki Okamoto, Hiroaki Yamamoto. drr 2000: 278-285 [doi]

Stochastic algorithm for detecting intersection of implicit surfacesSatoshi Tanaka, Yasushi Fukuda, Hiroaki Yamamoto. cg, 24(4):523-528, 2000. [doi]

Sampling implicit surfaces based on stochastic differential equations with converging constraintSatoshi Tanaka, Akio Morisaki, Satoru Nakata, Yasushi Fukuda, Hiroaki Yamamoto. cg, 24(3):419-431, 2000. [doi]

On the Power of Input-Synchronized Alternating Finite AutomataHiroaki Yamamoto. cocoon 2000: 457-466 [doi]

An Automata-Based Recognition Algorithm for Semi-extended Regular ExpressionsHiroaki Yamamoto. mfcs 2000: 699-708 [doi]

1998

Optimal Broadcasting in Almost Trees and Partial k-treesAnders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto. STACS 1998: 432-443

1997

On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a RestrictionHiroaki Yamamoto. TCS, 180(1-2):139-154, 1997. [doi]

1993

Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing MachinesHiroaki Yamamoto. icalp 1993: 203-214

1991

Note on the efficiency of methods to generate quasi-random sequencesHiroaki Yamamoto. scjapan, 22(2):25-33, 1991. [doi]

1987

Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMsHiroaki Yamamoto, Shoichi Noguchi. iandc, 75(2):144-161, November 1987.

1985

Relationships between time-leaf-and-space bounded ATMS and reversal-and-space bounded NTMsHiroaki Yamamoto, Shoichi Noguchi. scjapan, 16(2):20-28, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL