Mitsuo Yokoyama

17 papers B 2Journal 12Unranked 3
YearRankTypeTitle / Venue / Authors
2009 J jnl
Interference Canceller Based on Cycle-and-Add Property for Single User Detection in DS-CDMA.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ranga Hettiarachchi, Mitsuo Yokoyama, Hideyuki Uehara, Takashi Ohira
2008 J jnl
Interference Cancellation Technique Based on Discovery of Spreading Codes of Interference Signals and Maximum Correlation Detection for DS-CDMA System.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ranga Hettiarachchi, Mitsuo Yokoyama, Hideyuki Uehara
2007 J jnl
Efficient Clustering Scheme Considering Non-uniform Correlation Distribution for Ubiquitous Sensor Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Daisuke Maeda, Hideyuki Uehara, Mitsuo Yokoyama
2005 J jnl
Performance Improvement of MAI Cancellation in Fading DS/CDMA Channels.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kilsoo Jeong, Mitsuo Yokoyama, Hideyuki Uehara
2005 J jnl
Performance of a New DS-CDMA Synchronization System Using Cycle-and-Add Property.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yoshikazu Yamaguchi, Shinji Yamashita, Mitsuo Yokoyama, Hideyuki Uehara
2005 J jnl
Route Selection Metrics in Wireless Mobile Ad Hoc Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Md. Ifte Khairul Hasan, Saburo Takahashi, Jun-ichi Hakoda, Hideyuki Uehara, Mitsuo Yokoyama
2002 J jnl
A New OFDM Demodulation Method with Variable-Length Effective Symbol and ICI Canceller.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Noriyoshi Suzuki, Hideyuki Uehara, Mitsuo Yokoyama
2002 J jnl
OFDM Demodulation Method with Variable Effective Symbol Duration.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Noriyoshi Suzuki, Tsutayuki Shibata, Nobuo Itoh, Mitsuo Yokoyama
2002 J jnl
Source location problems considering vertex-connectivity and edge-connectivity simultaneously.
Networks
Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama
2001 J jnl
Lengths of tours and permutations on a vertex set of a convex polygon.
Discret. Appl. Math.
Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
2000 B conf
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets.
ISAAC
Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito
2000 B conf
Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks.
PIMRC
Hideyuki Uehara, Masato Fujihara, Mitsuo Yokoyama, Hiro Ito
2000 — conf
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon.
JCDCG
Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
1998 — conf
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces.
JCDCG
Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
1998 J jnl
Edge connectivity between nodes and node-subsets.
Networks
Hiro Ito, Mitsuo Yokoyama
1998 J jnl
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs.
Inf. Process. Lett.
Hiro Ito, Mitsuo Yokoyama
1998 — conf
NP-Completeness of Stage Illumination Problems.
JCDCG
Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama