|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2005-12-22 16:25 |
Tokushima |
The University of Tokushima |
Max-Stretch Reduction for Tree Spanners Kazuo Iwama (Kyoto Univ.), Andrzej Lingas (Lund Univ.), Masaki Okita (Kyoto Univ.) |
A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ whose
max-stretch is $t$, i.e., the distance between ... [more] |
COMP2005-56 pp.49-55 |
NS, RCS (Joint) |
2005-07-22 16:20 |
Okayama |
Okayama Univ.(Tsushima Campus) |
An Application of the Link Scheduling Algorithm to Communications among Access Points for WDS in Wireless LANs Shigeto Tajima (Osaka Univ.), Nobuo Funabiki (Okayama Univ.), Teruo Higashino (Osaka Univ.) |
The wireless distribution system (WDS) provides wireless communications between access points (APs) for inexpensive expa... [more] |
NS2005-74 pp.53-56 |
IA, MoNA |
2005-01-19 15:50 |
Osaka |
Osaka University Nakanoshima Center |
A Link Scheduling Algorithm Considering Reception Probability in Packet Radio Networks Shigeto Tajima (Osaka Univ.), Nobuo Funabiki (Okayama Univ.), Teruo Higashino (Osaka Univ.) |
In packet radio networks such as wireless local areas networks and ad-hoc mobile networks, periodic activations of the c... [more] |
MoMuC2004-101 IA2004-32 pp.81-86 |
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|