Demo Data from VLDB 2026 / reviewers in the wild / expert
Mikio Nakatsuyama
dblp:32/3270
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1986
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Visual content generation and editing · 100% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visual content generation and editing
pattern generation |
0.0 | 1 | 1986 | A Pattern Description and Generation Method of Structural Characters · IEEE Trans. Pattern Anal. Mach. Intell. 1986 |
Methods — techniques the papers use, named apart from their topics
syntactic grammar · 0.0block decomposition · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1986 | A Pattern Description and Generation Method of Structural CharactersabstractWe report a pattern description and generation method of structural characters, and show some examples of Chinese and Korean character patterns actually generated. We also consider its educational and graphical applications. In this method, any character is regarded as a composite pattern constructed by several simpler subpatterns, and is described in terms of them by introducing three kinds of positional relationships among them. A composite pattern can become a subpattern, too. We call these patterns blocks. Syntactic grammar is defined to encode a pattern expression by two code strings, that is, a string of blocks and a string of production rules. They are used in generating patterns, namely, derivation of pattern expression from the code strings is defined as a process of pattern generation. By this description and generation method, we can encode structural characters without much memory, and generate natural shapes of patterns. Hiroshi Nagahashi, Mikio Nakatsuyama |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |
| 1983 | Curve generation of implicit functions by incremental computers
Mikio Nakatsuyama, Kunihiro Kanno, Hiroshi Nagahashi, Norio Nishizuka |
Comput. Graph. | 1 |