| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2013)
Search Results: Keywords 'from:2014-03-10 to:2014-03-10'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2014-03-10 09:20 |
Tokyo | The Automatically Networking and Developing Intelligence
-- The Network Requirements Analysis of Individual and Human Intelligence based on Digital Language -- Kimiaki Tokumaru (System Engineer)  COMP2013-60 |
The emergence of modern human and language seem to have taken place in Indian and Atlantic Oceans coast in Middle Stone ... [more] | COMP2013-60 pp.1-8 |
|
| COMP | 2014-03-10 09:45 |
Tokyo | Quantum-Advised Algorithms for Biased Oracles Akinori Kawachi (Tokyo Inst. of Tech.) COMP2013-61 |
The biased oracles, which were originally motivated from cryptographic quantum reductions for the quantum Goldreich-... [more] |
COMP2013-61 pp.9-15 |
|
| COMP | 2014-03-10 10:05 |
Tokyo | On the hardness of the classical simulation of the DQC1 model Tomoyuki Morimae (Gunma Univ.), Keisuke Fujii (Kyoto Univ.), Joseph Fitzsimons (SUTD) COMP2013-62 |
[more] | COMP2013-62 pp.17-21 |
|
| COMP | 2014-03-10 10:30 |
Tokyo | Quantum Commuting Circuits and Complexity of Ising Partition Functions Keisuke Fujii (Kyoto Univ.), Tomoyuki Morimae (Gunma Univ.) COMP2013-63 |
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting t... [more] | COMP2013-63 pp.23-27 |
|
| COMP | 2014-03-10 11:05 |
Tokyo | A Heuristic for Quickest Transshipment Problem and its Application to Evacuation Planning Akio Ohta (Kyoto Univ.), Naoyuki Kamiyama (Kyusyu Univ.), Atsushi Takizawa (Osaka City Univ.), Naoki Katoh (Kyoto Univ.) COMP2013-64 |
Quickest transshipment problem is defined by a multi-source, multi-sink dynamic flow network, each source of that has a ... [more] | COMP2013-64 pp.29-34 |
|
| COMP | 2014-03-10 11:30 |
Tokyo | Redundancy of Rigidity of Convex Polyhedra under the Panel-Hinge Framework Model Yoshihiko Ito (Kyoto Univ.), Sergey Bereg (Univ. of Texas), Yuya Higashikawa, Naoki Katoh (Kyoto Univ.) COMP2013-65 |
[more] | COMP2013-65 pp.35-42 |
|
| COMP | 2014-03-10 11:55 |
Tokyo | Enumeration of neighborly polytopes and oriented matroids Hiroyuki Miyata (Tohoku Univ.), Arnau Padrol (Free Univ. of Berlin) COMP2013-66 |
[more] | COMP2013-66 pp.43-50 |
|
| COMP | 2014-03-10 13:20 |
Tokyo | [Fellow Memorial Lecture]
VLSI design and Big data - When quantities change quality Koichi Wada (Hosei U) COMP2013-67 |
The quantity of Big Data changes its quality and/or has to change its essential part. This situation has occurred in VLS... [more] | COMP2013-67 p.51 |
|
| COMP | 2014-03-10 14:15 |
Tokyo | Randomized consensus algorithm using MRSW registers under oblivious adversary Satoru Nakajima, Michiko Inoue (NAIST) COMP2013-68 |
In this paper, we propose an efficient randomized consensus algorithm in distributed shared register model under an obli... [more] | COMP2013-68 pp.53-60 |
|
| COMP | 2014-03-10 14:40 |
Tokyo | On Complexity of Distributed Diameter Approximation Taisuke Izumi (Nagoya Inst. of Tech.), Roger Wattenhofer (ETH Zurich) COMP2013-69 |
[more] | COMP2013-69 pp.61-68 |
|
| COMP | 2014-03-10 15:05 |
Tokyo | Safely-converging self-organization of a BFS tree with many leaves in virtual grid networks Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2013-70 |
We propose a safely-converging self-organization of a Breadth-First-Search spanning tree (BFS tree) with many leaves in ... [more] | COMP2013-70 pp.69-76 |
|
| COMP | 2014-03-10 15:40 |
Tokyo | Amoeba-inspired Algorithm and Its Realization Using Nanodevice Hiroyoshi Miwa (Kwansei Gakuin Univ.), Mashashi Aono (Tokyo Tech/JST), Makoto Naruse (NICT), Seiya Kasai (Hokkaido Univ.) COMP2013-71 |
Many metaheuristic algorithms have been studied so far to search for fairy good solutions to intractable computational ... [more] | COMP2013-71 pp.77-82 |
|
| COMP | 2014-03-10 16:05 |
Tokyo | Flip-Based Computation of Reeb Graphs for Triangular Meshes Masaki Moriguchi, Keiko Imai (Chuo Univ.) COMP2013-72 |
The Reeb graph of a function defined over a triangular mesh encodes the topological evolution of the level-sets of the f... [more] | COMP2013-72 pp.83-89 |
|
| COMP | 2014-03-10 16:30 |
Tokyo | Constant-time Delay Generation of Based Plane Triangulations Jun-ichi Koide, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani (Iwate Univ.) COMP2013-73 |
[more] | COMP2013-73 pp.91-98 |
|
[Return to Top Page]