EDBT 2026 Demo / reviewers in the wild / expert
Toru Aoki
dblp:66/6777
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 1Theory of computation · 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.
| Human-computer interaction and pervasive computing
1 paper |
Immersive interaction · 50% Collaborative and social computing · 50% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Immersive interaction
see-through display |
0.2 | 1 | 2014 | Tracs: transparency-control for see-through displays · UIST 2014 |
Coding theory › error-correcting codes
codes over rings |
0.0 | 1 | 1999 | On the covering radius of Z4-codes and their lattices · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes
covering radius |
0.0 | 1 | 1999 | On the covering radius of Z4-codes and their lattices · IEEE Trans. Inf. Theory 1999 |
Coding theory › lattice theory
lattices |
0.0 | 1 | 1999 | On the covering radius of Z4-codes and their lattices · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes › codes over rings
z4-linear code |
0.0 | 1 | 1999 | On the covering radius of Z4-codes and their lattices · IEEE Trans. Inf. Theory 1999 |
Coding theory
gray map |
0.0 | 1 | 1999 | On the covering radius of Z4-codes and their lattices · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes › nonlinear codes
nonlinear binary codes |
0.0 | 1 | 1999 | On the covering radius of Z4-codes and their lattices · IEEE Trans. Inf. Theory 1999 |
Methods — techniques the papers use, named apart from their topics
transparency control · 0.2polarization adjustment · 0.2sphere-covering bound · 0.0delsarte bound · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Tracs: transparency-control for see-through displaysabstractWe present Tracs, a dual-sided see-through display system with controllable transparency. Traditional displays are a constant visual and communication barrier, hindering fast and efficient collaboration of spatially close or facing co-workers. Transparent displays could potentially remove these barriers, but introduce new issues of personal privacy, screen content privacy and visual interference. We therefore propose a solution with controllable transparency to overcome these problems. Tracs consists of two see-through displays, with a transparency-control layer, a backlight layer and a polarization adjustment layer in-between. The transparency-control layer is built as a grid of individually addressable transparency-controlled patches, allowing users to control the transparency overall or just locally. Additionally, the locally switchable backlight layer improves the contrast of LCD screen content. Tracs allows users to switch between personal and collaborative work fast and easily and gives them full control of transparent regions on their display. David Lindlbauer, Toru Aoki, Robert Walter, Yuji Uema, Anita Vogl, Michael Haller, Masahiko Inami, Jörg Müller 0001 |
UIST | 2 |
| 1999 | On the covering radius of Z4-codes and their latticesabstractIn this correspondence, we investigate the covering radius of codes over Z/sub 4/ for the Lee and Euclidean distances in relation with those of binary nonlinear codes and lattices obtained by the Gray map and Construction A/sub 4/, respectively. We give several upper and lower bounds on covering radii, including Z/sub 4/-analogs of the sphere-covering bound, the packing radius bound, the Delsarte bound, and the redundancy bound. We show that any Euclidean-optimal Type II code of length 24 has covering radius 8 with respect to the Euclidean distance. We determine the covering radius of the Klemm codes with respect to the Lee distance. We derive lower bounds on the covering radii of the Niemeier lattices. Toru Aoki, Philippe Gaborit, Masaaki Harada, Michio Ozeki, Patrick Solé |
IEEE Trans. Inf. Theory | 1 |