default search action
Mitsuo Yokoyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j12]Ranga Hettiarachchi, Mitsuo Yokoyama, Hideyuki Uehara, Takashi Ohira:
Interference Canceller Based on Cycle-and-Add Property for Single User Detection in DS-CDMA. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 298-306 (2009) - 2008
- [j11]Ranga Hettiarachchi, Mitsuo Yokoyama, Hideyuki Uehara:
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. 91-A(11): 3335-3345 (2008) - 2007
- [j10]Daisuke Maeda, Hideyuki Uehara, Mitsuo Yokoyama:
Efficient Clustering Scheme Considering Non-uniform Correlation Distribution for Ubiquitous Sensor Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(7): 1344-1352 (2007) - 2005
- [j9]Kilsoo Jeong, Mitsuo Yokoyama, Hideyuki Uehara:
Performance Improvement of MAI Cancellation in Fading DS/CDMA Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2869-2877 (2005) - [j8]Yoshikazu Yamaguchi, Shinji Yamashita, Mitsuo Yokoyama, Hideyuki Uehara:
Performance of a New DS-CDMA Synchronization System Using Cycle-and-Add Property. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2905-2914 (2005) - [j7]Md. Ifte Khairul Hasan, Saburo Takahashi, Jun-ichi Hakoda, Hideyuki Uehara, Mitsuo Yokoyama:
Route Selection Metrics in Wireless Mobile Ad Hoc Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2952-2955 (2005) - 2002
- [j6]Noriyoshi Suzuki, Tsutayuki Shibata, Nobuo Itoh, Mitsuo Yokoyama:
OFDM Demodulation Method with Variable Effective Symbol Duration. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(7): 1665-1674 (2002) - [j5]Noriyoshi Suzuki, Hideyuki Uehara, Mitsuo Yokoyama:
A New OFDM Demodulation Method with Variable-Length Effective Symbol and ICI Canceller. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(12): 2859-2867 (2002) - [j4]Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama:
Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40(2): 63-70 (2002) - 2001
- [j3]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Lengths of tours and permutations on a vertex set of a convex polygon. Discret. Appl. Math. 115(1-3): 63-71 (2001) - 2000
- [c5]Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito:
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. ISAAC 2000: 338-349 - [c4]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. JCDCG 2000: 160-166 - [c3]Hideyuki Uehara, Masato Fujihara, Mitsuo Yokoyama, Hiro Ito:
Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks. PIMRC 2000: 222-226
1990 – 1999
- 1998
- [j2]Hiro Ito, Mitsuo Yokoyama:
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. Inf. Process. Lett. 66(4): 209-213 (1998) - [j1]Hiro Ito, Mitsuo Yokoyama:
Edge connectivity between nodes and node-subsets. Networks 31(3): 157-163 (1998) - [c2]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. JCDCG 1998: 129-157 - [c1]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
NP-Completeness of Stage Illumination Problems. JCDCG 1998: 158-165
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: