Mitsuo Yokoyama

According to our database1, Mitsuo Yokoyama authored at least 17 papers between 1998 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Interference Canceller Based on Cycle-and-Add Property for Single User Detection in DS-CDMA.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2008
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., 2008

2007
Efficient Clustering Scheme Considering Non-uniform Correlation Distribution for Ubiquitous Sensor Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2005
Performance of a New DS-CDMA Synchronization System Using Cycle-and-Add Property.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Performance Improvement of MAI Cancellation in Fading DS/CDMA Channels.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Route Selection Metrics in Wireless Mobile Ad Hoc Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2002
Source location problems considering vertex-connectivity and edge-connectivity simultaneously.
Networks, 2002

A New OFDM Demodulation Method with Variable-Length Effective Symbol and ICI Canceller.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

OFDM Demodulation Method with Variable Effective Symbol Duration.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2001
Lengths of tours and permutations on a vertex set of a convex polygon.
Discret. Appl. Math., 2001

2000
Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks.
Proceedings of the 11th IEEE International Symposium on Personal, 2000

Sum of Edge Lengths of a Graph Drawn on a Convex Polygon.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1998
Edge connectivity between nodes and node-subsets.
Networks, 1998

Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs.
Inf. Process. Lett., 1998

NP-Completeness of Stage Illumination Problems.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998


  Loading...