| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| CPSY, DC, IPSJ-ARC (Joint) [detail] |
2017-07-28 10:00 |
Akita | Akita Atorion-Building (Akita) | Distributed Stream Processing Platform for CPU-FPGA Heterogeneous Data Centers Eric Fukuda, Naif Tarafdar (Univ. of Toronto), I-Cheng Chen (AMD), Paul Chow (Univ. of Toronto)  CPSY2017-32 |
The FPGAs provided in recent data centers are often tied to processors through PCIe. This adds overhead to data transfer... [more] | CPSY2017-32 pp.171-176 |
| QIT (2nd) |
2016-05-30 09:30 |
Kochi | Kochi University of Technology Eikokuji campus | Fundamental limitation for quantum communication over the network Koji Azuma (NTT BRL), Akihiro Mizutani (Osaka Univ.), Hoi-Kwong Lo (Univ. of Toronto) |
[more] | |
| MSS, CAS, SIP, VLD | 2015-06-17 10:45 |
Hokkaido | Otaru University of Commerce | Extension of One-Instruction-Set Computer and Its Evaluation Noriaki Sakamoto, Tanvir Ahmed (Tokyo Tech), Jason H. Anderson (Univ. of Toronto), Yuko Hara-Azumi (Tokyo Tech) CAS2015-4 VLD2015-11 SIP2015-35 MSS2015-4 |
Subleq computer is one of the best-known Turing-Complete One-Instruction-Set Computers. Subleq instruction is a three-op... [more] | CAS2015-4 VLD2015-11 SIP2015-35 MSS2015-4 pp.19-24 |
| QIT (2nd) |
2014-11-18 14:10 |
Miyagi | Tohoku Univ. | Quantum repeaters with linear optics Koji Azuma, Kiyoshi Tamaki (NTT BRL), Hoi-Kwong Lo (Univ. of Toronto) |
[more] | |
| QIT (2nd) |
2012-05-22 10:40 |
Fukui | Fukui Univ. | Phase encoding schemes for measurement device independent quantum key distribution with basis information flaw Kiyoshi Tamaki (NTT BRL), Hoi-Kwong Lo (Univ. of. Toronto), Chi-Hang Fred Fung (Hong Kong Univ.), Bing Qi (Univ. of. Toronto) |
[more] | |
| CS, OCS (Joint) |
2012-01-27 12:05 |
Mie | ISESHI-KANKOUBUNKAKAIKAN | * Kiyoshi Tamaki (NTT BRL), Hoi-Kwong Lo (Univ of Toronto), Chi-Hang Fred Fung (Univ of Hong Kong), Bing Qi (Univ of Toronto) CS2011-93 |
(Advance abstract in Japanese is available) [more] | CS2011-93 pp.67-68 |
| COMP | 2011-10-21 14:25 |
Miyagi | Tohoku Univ. | Complexity Theory for Operators in Analysis Akitoshi Kawamura (Univ. of Tokyo), Stephen Cook (Univ. of Toronto) COMP2011-32 |
We propose a new framework for discussing the computational complexity of problems involving uncountably many objects, s... [more] | COMP2011-32 pp.25-32 |
| COMP | 2010-01-25 10:55 |
Fukuoka | Nishijin Plaza, Kyushu University | Distance k-Sectors Exist Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ.), Daniel Reem (Technion - Israel Inst. of Tech.) COMP2009-41 |
The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. ... [more] | COMP2009-41 pp.17-22 |
| COMP | 2010-01-25 11:30 |
Fukuoka | Nishijin Plaza, Kyushu University | Zone Diagrams in Euclidean Spaces and in Other Normed Spaces Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ./ETH Zurich) COMP2009-42 |
Zone diagram is a variation on the classical concept of a Voronoi diagram. Given n sites in a metric space that compete ... [more] | COMP2009-42 pp.23-28 |
| NLP | 2010-01-21 15:20 |
Gifu | Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete Akitoshi Kawamura (U. Toronto) NLP2009-145 |
In answer to Ko's question raised in 1983, we show that an initial value problem given by a polynomial-time computable, ... [more] | NLP2009-145 pp.31-36 |
|
| COMP | 2007-12-14 15:25 |
Hiroshima | Hiroshima University | Computational Complexity of Initial-Value Problems with the Lipschitz Condition Akitoshi Kawamura (Toronto) COMP2007-52 |
We show, in answer to Ko's 1983 question, that an initial value problem given by a polynomial-time computable, Lipschitz... [more] | COMP2007-52 pp.29-34 |
[Return to Top Page]