|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2014)
|
|
Search Results: Keywords 'from:2014-10-08 to:2014-10-08'
|
[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 |
2014-10-08 10:20 |
Tokyo |
Chuo University |
On Extended Complexity of Generalized Transversal Matroids Shuichi Hirahara, Hiroshi Imai (Univ. of Tokyo) COMP2014-25 |
[more] |
COMP2014-25 pp.1-4 |
COMP |
2014-10-08 10:50 |
Tokyo |
Chuo University |
The State Complexity of Two-Way Quantum Finite Automata Marcos Villagra, Tomoyuki Yamakami (Univ. of Fukui) COMP2014-26 |
[more] |
COMP2014-26 pp.5-8 |
COMP |
2014-10-08 11:20 |
Tokyo |
Chuo University |
Algorithms for the Minimum Vulnerability Problem Yusuke Aoki (Tohoku Univ.), Bjarni V. Halldorsson, Magnus M. Halldorsson (Reykjavik Univ.), Takehiro Ito (Tohoku Univ.), Christian Konrad (Reykjavik Univ.), Xiao Zhou (Tohoku Univ.) COMP2014-27 |
[more] |
COMP2014-27 pp.9-15 |
COMP |
2014-10-08 13:30 |
Tokyo |
Chuo University |
[Invited Talk]
Statistical Maximum and Minimum Operations for Gaussian Mixture Model and Their Applications Shuji Tsukiyama (Chuo Univ.) COMP2014-28 |
Due to the progress of micro-technology, process variability is increasing in not only inter-die but also intra-die, and... [more] |
COMP2014-28 pp.17-18 |
COMP |
2014-10-08 14:45 |
Tokyo |
Chuo University |
Reconfiguration of List Colorings in a Graph Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29 |
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] |
COMP2014-29 pp.19-24 |
COMP |
2014-10-08 15:15 |
Tokyo |
Chuo University |
Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams Yuma Inoue, Shin-ichi Minato (Hokkaido Univ.) COMP2014-30 |
An Eulerian trail is a trail containing all edges of a given graph exactly once.
Although counting problem of Eulerian ... [more] |
COMP2014-30 pp.25-29 |
COMP |
2014-10-08 15:45 |
Tokyo |
Chuo University |
Implicant Size of a CNF Formula with Many Satisfying Assignments Daniel Kane (Stanford Univ.), Osamu Watanabe (Tokyo Inst. of Tech.) COMP2014-31 |
[more] |
COMP2014-31 pp.31-37 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|