| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2012)
Search Results: Keywords 'from:2012-06-21 to:2012-06-21'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2012-06-21 09:30 |
Hokkaido | Hokkaido University | Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.)  COMP2012-12 |
There are various combinatorial problems whose solutions can be represented as a family of sets. The Zero-suppressed Bi... [more] | COMP2012-12 pp.1-7 |
| COMP | 2012-06-21 09:55 |
Hokkaido | Hokkaido University | Rich Operations for Manipulating Sequence Binary Decision Diagrams Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato (Hokkaido Univ.) COMP2012-13 |
Manipulating large sequence data is important problem in string processing field. In this paper, we deal with sequence b... [more] | COMP2012-13 pp.9-16 |
| COMP | 2012-06-21 10:20 |
Hokkaido | Hokkaido University | Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ) COMP2012-14 |
[more] | COMP2012-14 pp.17-24 |
| COMP | 2012-06-21 11:00 |
Hokkaido | Hokkaido University | Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII) COMP2012-15 |
This report presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known ... [more] | COMP2012-15 pp.25-31 |
| COMP | 2012-06-21 11:25 |
Hokkaido | Hokkaido University | Recursive and non recursive formulas in finitism Eiichi Tanaka (Kobe Univ.) COMP2012-16 |
This report shows that the diagonalization in the set of all finite length unary functions (formulas) produces a non-fin... [more] | COMP2012-16 pp.33-40 |
| COMP | 2012-06-21 13:20 |
Hokkaido | Hokkaido University | A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis Kazuhisa Seto, Suguru Tamaki (Kyoto Univ.) COMP2012-17 |
We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis... [more] | COMP2012-17 pp.41-48 |
| COMP | 2012-06-21 13:45 |
Hokkaido | Hokkaido University | Candidate Boolean Functions towards Super-Quadratic Formula Size Kenya Ueno (Kyoto Univ.) COMP2012-18 |
In this paper, we explore possibilities and difficulties to prove super-quadratic formula size lower bounds from the fol... [more] | COMP2012-18 pp.49-55 |
| COMP | 2012-06-21 14:10 |
Hokkaido | Hokkaido University | Complexity results of distance-d independent set problems Hiroshi Eto, Fengrui Guo, Eiji Miyano (Kyutech) COMP2012-19 |
[more] | COMP2012-19 pp.57-63 |
| COMP | 2012-06-21 14:50 |
Hokkaido | Hokkaido University | An Algorithm for the Next-to-Shortest Path in Undirected Planar Graphs Cong Zhang, Hiroshi Nagamochi (Kyoto Univ.) COMP2012-20 |
[more] | COMP2012-20 pp.65-70 |
| COMP | 2012-06-21 15:15 |
Hokkaido | Hokkaido University | Efficient Atomic Block for Faster Elliptic Curve Scalar Multiplication Chitchanok Chuengsatiansup (Univ. of Tokyo) COMP2012-21 |
We have developed new atomic patterns for faster elliptic curve scalar multiplication by rearranging field arithmetic an... [more] | COMP2012-21 pp.71-78 |
| COMP | 2012-06-21 15:40 |
Hokkaido | Hokkaido University | Optimal Average Joint Hamming Weight for Asymmetric Representation Vorapong Suppakitpaisarn (Univ. of Tokyo), Masato Edahiro (Nagoya Univ.), Hiroshi Imai (Univ. of Tokyo) COMP2012-22 |
[more] | COMP2012-22 pp.79-86 |
| COMP | 2012-06-21 16:20 |
Hokkaido | Hokkaido University | A method for computing a sequence of circumscribing polygons Kensuke Onishi (Tokai Univ.), Mamoru Hoshi (UEC) COMP2012-23 |
We have studied algorithm for computing a sequence of circumscribing polygons. In our previous paper, we proposed two co... [more] | COMP2012-23 pp.87-93 |
| COMP | 2012-06-21 16:45 |
Hokkaido | Hokkaido University | Approximation for the Geometric Unique Coverage Problem on Unit Squares Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.) COMP2012-24 |
[more] | COMP2012-24 pp.95-101 |
| COMP | 2012-06-21 17:10 |
Hokkaido | Hokkaido University | Notes on weighted Delaunay triangulations and discrete Ricci flow
-- Relation between weighted Delaunay triangulations and circle packing metrics -- Toshihiro Tanuma, Hiroshi Imai (Univ. of Tokyo) COMP2012-25 |
This research is related to weighted Delaunay triangulations and a discrete Ricci flow. Specifically, we consider the fo... [more] | COMP2012-25 pp.103-109 |
[Return to Top Page]