Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hiroshi Taniguchi

dblp:56/6799 · DBLP profile ↗
← Back
12ranked-venue papers
1as first author
0since 2021 · last 2001
0000-0002-5916-5040ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 6 · 1 first-authorTheory of computation · 6Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Theoretical computer science
2 papers
Automata and formal languages · 46% Computational complexity · 46% Information theory · 7%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
turing machines
0.021982
Two-Dimensional Alternating Turing Machines with Only Universal States · Inf. Control. 1982
Two-Dimensional Alternating Turing Machines · STOC 1982
Computational complexity › computational models
alternating turing machines
0.011982
Two-Dimensional Alternating Turing Machines with Only Universal States · Inf. Control. 1982
Computational complexity
space complexity
0.011982
Two-Dimensional Alternating Turing Machines · STOC 1982
Information theory
pattern recognition
0.011982
Two-Dimensional Alternating Turing Machines · STOC 1982

Methods — techniques the papers use, named apart from their topics

leaf-size bound · 0.0complexity measure · 0.0
YearPublicationVenuePosition
2001 Reconstruction method for compensation of surface effects in transillumination laser CT
abstract
A reconstruction method for transillumination laser CT using optical heterodyne detection is proposed. Laser CT does not obey the Radon transform due to surface effects, which occur as a result of refractive index mismatch and bring about an annulus artifact. Optical attenuation with surface effects is described using an affine model. In addition, the constraint derived from the quantitative relationship between projections is introduced in order to obtain a stable solution to the system of equations. This reconstruction produces a least squares problem with the above-mentioned constraint, which is solved via the conjugate gradient method. The method is applied to data from a physical phantom.
Tetsuya Yuasa, Balasigamani Devaraj, Shinji Tanosaki, Hiroshi Taniguchi, Takao Akatsuka
ICIP (1)4
1985 A space-hierarchy result on two-dimensional alternating Turing machines with only universal states
Katsushi Inoue, Akira Ito 0001, Itsuo Takanami, Hiroshi Taniguchi
Inf. Sci.4
1985 Alternating Simple Multihead Finite Automata
Hiroshi Matsuno, Katsushi Inoue, Hiroshi Taniguchi, Itsuo Takanami
Theor. Comput. Sci.3
1983 Two-dimensional automata with rotated inputs (projection-type)
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Inf. Sci.3
1983 A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Theor. Comput. Sci.3
1983 Two-Dimensional Alternating Turing Machines
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Theor. Comput. Sci.3
1982 Two-Dimensional Alternating Turing Machines
abstract
This paper introduces a two-dimensional alternating Turing machine (2-ATM) which is an extension of an alternating Turing machine to two-dimensions. This paper also introduces a three-way two-dimensional alternating Turing machine (TR2-ATM) which is an alternating version of a three-way two-dimensional Turing machine. We first investigate a relationship between the accepting powers of space-bounded 2-ATM's (or TR2-ATM's) and ordinary space-bounded two-dimensional Turing machines (or three-way two-dimensional Turing machines). We then introduce a simple, natural complexity measure for 2-ATM's (or TR2-ATM's), called “leaf-size”, and provides a spectrum of complexity classes based on leaf-size bounded computations. We finally investigate the recognizability of connected patterns by 2-ATM's (or TR2-ATM's).
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
STOC3
1982 Two-Dimensional Alternating Turing Machines with Only Universal States
Akira Ito 0001, Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Inf. Control.4
1982 A Note on Alternating On-Line Turing Machines
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Inf. Process. Lett.3
1982 A note on rebound automata
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Inf. Sci.3
1982 A note on three-dimensional finite automata
Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami
Inf. Sci.1
1980 Two-dimensional automata with rotated inputs
Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Inf. Sci.3