|
|
|
|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2006)
|
|
|
|
Search Results: Keywords 'from:2006-12-04 to:2006-12-04'
|
| [Go to Official COMP Homepage (Japanese)] |
| Search Results: Conference Papers |
| Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
|
| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2006-12-04
09:00 |
Aichi |
Nagoya University |
Lower Bounds for Partially-Ordered Read-Once Branching Program
Nobuhito Shinohara, Kazuyoshi Takagi, Naofumi Takagi (Nagoya Univ.) |
[more] |
COMP2006-41
pp.1-8 |
| COMP |
2006-12-04
09:30 |
Aichi |
Nagoya University |
Economic-inspired truthful reputation feedback mechanism in P2P networks
Yufeng Wang, Yoshiaki Hori, Kouichi Sakurai (Kyushu Univ.) |
[more] |
COMP2006-42
pp.9-14 |
| COMP |
2006-12-04
10:00 |
Aichi |
Nagoya University |
weighted nearest neighbor algorithms for the graph exploration problem on cycles
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.), Takuro Yoshimuta (KIT) |
[more] |
COMP2006-43
pp.15-22 |
| COMP |
2006-12-04
14:20 |
Aichi |
Nagoya University |
Error-detection-miss probability of the EAN barcode
Yukinori Taguchi, Nobuki Tokura (Tottori Univ. of Environmental Studies) |
[more] |
COMP2006-44
pp.23-28 |
| COMP |
2006-12-04
14:50 |
Aichi |
Nagoya University |
A Gathering Problem for autonomous mobile robots with disagreement in time varying compasses
Yuichi Tomida (NIT), Hiroyuki Imazu (AISIN AW), Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) |
[more] |
COMP2006-45
pp.29-36 |
| COMP |
2006-12-04
15:20 |
Aichi |
Nagoya University |
A Self-Stabilizing Protocol for k-hop Clustering with Solid-discs On Sensor Networks
Shingo Omura, Naoki Inaba, Yoshiaki Katayama, Koichi Wada (Nagoya Instit. of Tech.) |
[more] |
COMP2006-46
pp.37-44 |
| COMP |
2006-12-04
16:05 |
Aichi |
Nagoya University |
A note on non-overlapping words
Tetsuo Moriya (Kokushikan Univ.) |
[more] |
COMP2006-47
pp.45-48 |
| COMP |
2006-12-04
16:35 |
Aichi |
Nagoya University |
1.875-approximation algorithm for the stable marriage problem
Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
[more] |
COMP2006-48
pp.49-56 |
| COMP |
2006-12-04
17:05 |
Aichi |
Nagoya University |
Linear-Size Log-Depth Negation-Limited Inverter for k-tonic 0/1 Sequences
Hiroki Morizumi (Kyoto Univ.), Jun Tarui (Univ. of Electro-Comm.) |
A binary sequence $x_1, \ldots, x_n$ is called $k$-tonic if for $1 \leq i \leq n-1$ the number of $i$'s such that $x_i \... [more] |
COMP2006-49
pp.57-60 |
|
|
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|