電子情報通信学会技術研究報告

Print edition: ISSN 0913-5685      Online edition: ISSN 2432-6380

Volume 112, Number 93

コンピュテーション

開催日 2012-06-21 / 発行日 2012-06-14

[PREV] [NEXT]

[TOP] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


目次

COMP2012-12
組合せ問題の解を列挙索引化するZDD構築アルゴリズムの汎用化
○川原 純(JST/北大)・湊 真一(北大/JST)
pp. 1 - 7

COMP2012-13
系列二分決定グラフを操作するための豊富な演算体系の構築
○伝住周平・有村博紀(北大)・湊 真一(北大/JST)
pp. 9 - 16

COMP2012-14
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)
pp. 17 - 24

COMP2012-15
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
Tatsuya Akutsu・○Takeyuki Tamura(Kyoto Univ.)・Daiji Fukagawa(Doshisha Univ.)・Atsuhiro Takasu(NII)
pp. 25 - 31

COMP2012-16
Recursive and non recursive formulas in finitism
○Eiichi Tanaka(Kobe Univ.)
pp. 33 - 40

COMP2012-17
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
○Kazuhisa Seto・Suguru Tamaki(Kyoto Univ.)
pp. 41 - 48

COMP2012-18
Candidate Boolean Functions towards Super-Quadratic Formula Size
○Kenya Ueno(Kyoto Univ.)
pp. 49 - 55

COMP2012-19
距離d独立頂点集合問題の計算複雑さ
江藤 宏・郭 豊瑞・○宮野英次(九工大)
pp. 57 - 63

COMP2012-20
An Algorithm for the Next-to-Shortest Path in Undirected Planar Graphs
○Cong Zhang・Hiroshi Nagamochi(Kyoto Univ.)
pp. 65 - 70

COMP2012-21
Efficient Atomic Block for Faster Elliptic Curve Scalar Multiplication
○Chitchanok Chuengsatiansup(Univ. of Tokyo)
pp. 71 - 78

COMP2012-22
Optimal Average Joint Hamming Weight for Asymmetric Representation
○Vorapong Suppakitpaisarn(Univ. of Tokyo)・Masato Edahiro(Nagoya Univ.)・Hiroshi Imai(Univ. of Tokyo)
pp. 79 - 86

COMP2012-23
包含多角形列の計算手法とその実験的解析
○大西建輔(東海大)・星 守(電通大)
pp. 87 - 93

COMP2012-24
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.)
pp. 95 - 101

COMP2012-25
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)
pp. 103 - 109

注: 本技術報告は査読を経ていない技術報告であり,推敲を加えられていずれかの場に発表されることがあります.


IEICE / 電子情報通信学会