Tsunehiko Kameda

Publication List Details

Period

1968 - 2008

Number

9

Co-Authors

Minimizing Average Startup Delay of Periodic VOD Broadcasting Schedules (2008)

Yi Sun, Tsunehiko Kameda

Abstract — Consider a video consisting of a sequence of fixedsize pages to be transmitted over c broadcast channels such that a page fits in a slot of a channel. In Shifted Harmonic Windows...

Simple Characterization of Polygons Searchable by 1-Searcher (2008)

Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita

Suppose intruders are in a dark polygonal room and they can move arbitrarily fast, trying to avoid detection. A boundary 1-searcher can move along the polygon boundary, equipped with a flash light...

COCOON05 1 An Optimization Problem Related to Truncated Harmonic Broadcasting for Video-on-Demand (2008)

Tsunehiko Kameda, Yi Sun, Luis Goddyn

Fixed-Delay Pagoda Broadcasting (FDPB) is a practical broadcasting scheme for video-on-demand proposed by Pâris, and its prototype has been built. In order for any broadcasting scheme to be truly...

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (1996)

Masafumi Yamashita, Masafumi Yamashita, Hideki Umemoto, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda, ...

The problem of searching for mobile intruders in a polygonal region by mobile searchers is considered. A searcher can move continuously inside a polygon holding a flashlight that emits a single ray...

Computing on anonymous networks, part I: characterizing the solvable cases (1996)

Masafumi Yamashita, Tsunehiko Kameda, Affiliate Member

Abstract — In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the...

Searching for a Mobile Intruder in a Polygonal Region (1992)

Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda

Part of this work was done by the author when he was at the Graduate School of Hiroshima University. 0 The problem of searching for mobile intruders in a polygonal region by mobile searchers is...