Max- and Min-Neighborhood Monopolies ∗ (2008)
Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
Given a graph G = (V, E) and a set of vertices M ⊆ V, a vertex v ∈ V is said to be controlled by M if the majority of v’s neighbors (including itself) belongs to M. M is called a monopoly in...
TRANSFORMATIONS ON REGULAR NONDOMINATED COTERIES AND THEIR APPLICATIONS ∗ (2008)
Abstract. A coterie under an underlying set U is a family of subsets of U such that every pair of subsets has at least one element in common, but neither is a subset of the other. A coterie C under U...
Toshihide Ibaraki, Tiko Kameda, Ravi Krishnamurthy, Haran Boral, Carlo Zaniolo, Arjan Pellenkoft, ...
Optimizing large join queries using a graph-based approach.
An efficient VOD broadcasting scheme with user bandwidth limit (2003)
Edward Mingjun Yan, Tiko Kameda
To address the scalability issue in video-on-demand systems, many broadcasting schemes have been proposed to date. The major performance parameters of such a broadcasting scheme are the server...
Searching a polygonal region from the boundary (2001)
Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda
Polygon search is the problem of finding unpredictable mobile intruders in a polygonal region using one or more mobile searchers with various levels of vision, where both the searcher and intruders...
Searching a Polygonal Region from the Boundary \Lambda (2000)
Ichiro Suzukiy, Yuichi Tazoez, Masafumi Yamashitax, Tiko Kameda
Abstract Polygon search is the problem of finding mobile intruders who move unpredictably in a polygonal region using one or more mobile searchers having various levels of vision, where both the...
Constructing Classification Trees with Exception Annotations for Large Datasets (1999)
Jin Li, Name Jin Li, Dr. Tiko Kameda
Classification is an important problem in data mining, which identifies essential features of different classes based on a set of training data and then classifies new instances into appropriate...
Transformation of Regular Non-Dominated Coteries (1999)
Kazuhisa Makino, Tiko Kameda, D Satisfying Q
A coterie is a family of subsets such that every pair of subsets has at least one element in common but neither is a subset of the other. A coterie C is said to be non-dominated (ND) if there is no...
How To Learn An Unknown Environment I: The Rectilinear Case (1997)
Xiaotie Deng, Tiko Kameda, Christos Papadimitriou
We consider the problem faced by a robot that must explore and learn an unknown room with obstacles in it. We seek algorithms that achieve a bounded ratio of the worst-case distance traversed in...