| 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:2013-05-17 to:2013-05-17'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2013-05-17 09:55 |
Hokkaido | Otaru University of Commerce | Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals Daiki Hoshika, Eiji Miyano (Kyushu Inst. of Tech.)  COMP2013-9 |
In this paper we study the maximum packing element-disjoint Steiner tree problem(element-disjoint MaxPST problem, for s... [more] |
COMP2013-9 pp.7-12 |
| COMP, IPSJ-AL | 2013-05-17 11:25 |
Hokkaido | Otaru University of Commerce | A New Subclass of P-matrix Linear Complementarity Problems Komei Fukuda (ETH Zurich), Lorenz Klaus (NII/JST), Hiroyuki Miyata (Tohoku Univ.) COMP2013-10 |
[more] | COMP2013-10 pp.25-32 |
| COMP, IPSJ-AL | 2013-05-17 13:35 |
Hokkaido | Otaru University of Commerce | Query Complexity of Witness Finding Akinori Kawachi (Tokyo Inst. of Tech.), Benjamin Rossman (NII), Osamu Watanabe (Tokyo Inst. of Tech.) COMP2013-11 |
For any polynomial-time relation L subset_of {0,1}^m x {0,1}^n where n = m^{O(1)}, the classic search-to-decision reduct... [more] | COMP2013-11 pp.39-46 |
| COMP, IPSJ-AL | 2013-05-17 15:05 |
Hokkaido | Otaru University of Commerce | Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12 |
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] | COMP2013-12 pp.63-70 |
| COMP, IPSJ-AL | 2013-05-17 16:05 |
Hokkaido | Otaru University of Commerce | On Complexities of Parallel Sort Algorithms on AGPU model Atsushi Koike, Kunihiko Sadakane, Hoa Vu (NII) COMP2013-13 |
This paper is concerned with complexities of parallel sorting algorithms on AGPU model. First, we analyze known sort al... [more] |
COMP2013-13 pp.75-80 |
| COMP, IPSJ-AL | 2013-05-18 09:55 |
Hokkaido | Otaru University of Commerce | Complexity of Counting Output Patterns of Logic Circuits Kei Uchizawa (Yamagata Univ.), Zhenghong Wang (Tohoku Univ.), Hiroki Morizumi (Shimane Univ.), Xiao Zhou (Tohoku Univ.) COMP2013-14 |
Let $C$ be a logic circuit consisting of $s$ gates $g_1, g_2, dots , g_s$, then the output pattern of $C$ for an input... [more] |
COMP2013-14 pp.97-102 |
| COMP, IPSJ-AL | 2013-05-18 11:25 |
Hokkaido | Otaru University of Commerce | Testing Subdivision-Freeness
-- Property Testing Meets Structural Graph Theory -- Ken-ichi Kawarabayashi (NII), Yuichi Yoshida (NII/PFI) COMP2013-15 |
Testing a property P of graphs in the bounded-degree model deals with the following problem: given a graph G of bounded ... [more] | COMP2013-15 pp.117-121 |
| COMP, IPSJ-AL | 2013-05-18 14:25 |
Hokkaido | Otaru University of Commerce | A New Framework for Connected Components Labeling of Binary Images Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas) COMP2013-16 |
Given a binary image of $n$ pixels, assign integral labels to all pixels so that any background pixel has label $0$ ... [more] |
COMP2013-16 pp.127-134 |
| COMP, IPSJ-AL | 2013-05-18 15:30 |
Hokkaido | Otaru University of Commerce | On parallel complexity of MapReduce computation Koichi Wada (Hosei Univ.), Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-17 |
[more] | COMP2013-17 pp.143-147 |
| COMP, IPSJ-AL | 2013-05-18 16:30 |
Hokkaido | Otaru University of Commerce | Label Size Maximization for Rotating Maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2013-18 |
Map labeling is a problem of placing labels at the corresponding graphical features in a map. There are two optimizati... [more] |
COMP2013-18 pp.157-162 |
[Return to Top Page]