 | 2009 |
|---|
| 21 |       | Hiroaki Yamamoto,
Daichi Takenouchi:
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees.
WADS 2009: 554-565 |
| 2007 |
|---|
| 20 | | Hideaki Yokota,
Akio Yamamoto,
Hiroaki Yamamoto,
Toshiro Higuchi:
Producing Softness Sensation on an Electrostatic Texture Display for Rendering Diverse Tactile Feelings.
WHC 2007: 584-585 |
| 19 | | Hiroaki Yamamoto,
Takashi Miyazaki,
Masayuki Okamoto:
Bit-Parallel Algorithms for Translating Regular Expressions into NFAs.
IEICE Transactions 90-D(2): 418-427 (2007) |
| 2006 |
|---|
| 18 | | 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): 168-177 (2006) |
| 2005 |
|---|
| 17 | | 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.
IJDAR 7(2-3): 105-122 (2005) |
| 16 | | Hiroaki Yamamoto:
New finite automata corresponding to semiextended regular expressions.
Systems and Computers in Japan 36(10): 54-61 (2005) |
| 2004 |
|---|
| 15 | | 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: 209-216 |
| 2003 |
|---|
| 14 | | Hiroaki Yamamoto,
Takashi Miyazaki:
A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions.
COCOON 2003: 222-231 |
| 13 | | Hiroaki Yamamoto:
A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.
ISAAC 2003: 158-167 |
| 2001 |
|---|
| 12 | | Hiroaki Yamamoto:
A New Recognition Algorithm for Extended Regular Expressions.
ISAAC 2001: 257-267 |
| 11 |  | 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) |
| 10 | | Satoshi Tanaka,
Tomoharu Nakamura,
Miharu Ueda,
Hiroaki Yamamoto,
Kisou Shino:
Application of the stochastic sampling method to various implicit surfaces.
Computers & Graphics 25(3): 441-448 (2001) |
| 2000 |
|---|
| 9 | | Hiroaki Yamamoto:
On the Power of Input-Synchronized Alternating Finite Automata.
COCOON 2000: 457-466 |
| 8 | | Hiroaki Yamamoto:
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.
MFCS 2000: 699-708 |
| 7 | | Satoshi Tanaka,
Akio Morisaki,
Satoru Nakata,
Yasushi Fukuda,
Hiroaki Yamamoto:
Sampling implicit surfaces based on stochastic differential equations with converging constraint.
Computers & Graphics 24(3): 419-431 (2000) |
| 6 | | Satoshi Tanaka,
Yasushi Fukuda,
Hiroaki Yamamoto:
Stochastic algorithm for detecting intersection of implicit surfaces.
Computers & Graphics 24(4): 523-528 (2000) |
| 5 | | Hideo Kasuga,
Hiroaki Yamamoto,
Masayuki Okamoto:
Color quantization using the fast K-means algorithm.
Systems and Computers in Japan 31(8): 33-40 (2000) |
| 1998 |
|---|
| 4 | | Anders Dessmark,
Andrzej Lingas,
Hans Olsson,
Hiroaki Yamamoto:
Optimal Broadcasting in Almost Trees and Partial k-trees.
STACS 1998: 432-443 |
| 1997 |
|---|
| 3 | | Hiroaki Yamamoto:
On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction.
Theor. Comput. Sci. 180(1-2): 139-154 (1997) |
| 1993 |
|---|
| 2 | | Hiroaki Yamamoto:
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines.
ICALP 1993: 203-214 |
| 1987 |
|---|
| 1 | | Hiroaki Yamamoto,
Shoichi Noguchi:
Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs
Inf. Comput. 75(2): 144-161 (1987) |
