| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2009)
Search Results: Keywords 'from:2010-01-25 to:2010-01-25'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2010-01-25 09:30 |
Fukuoka | Nishijin Plaza, Kyushu University | Competitive Analysis of the k-Canadian Traveller Problem for Graphs with Restricted Edge Weights Takeshi Fukuda, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)  COMP2009-39 |
The $k$-Canadian Traveller Problem ($k$-CTP) is one of the online problems. In this problem, we are given an undirected... [more] |
COMP2009-39 pp.1-8 |
| COMP | 2010-01-25 10:05 |
Fukuoka | Nishijin Plaza, Kyushu University | Complexity results for the spanning tree congestion problem Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40 |
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] | COMP2009-40 pp.9-16 |
| COMP | 2010-01-25 10:55 |
Fukuoka | Nishijin Plaza, Kyushu University | Distance k-Sectors Exist Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ.), Daniel Reem (Technion - Israel Inst. of Tech.) COMP2009-41 |
The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. ... [more] | COMP2009-41 pp.17-22 |
| COMP | 2010-01-25 11:30 |
Fukuoka | Nishijin Plaza, Kyushu University | Zone Diagrams in Euclidean Spaces and in Other Normed Spaces Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ./ETH Zurich) COMP2009-42 |
Zone diagram is a variation on the classical concept of a Voronoi diagram. Given n sites in a metric space that compete ... [more] | COMP2009-42 pp.23-28 |
| COMP | 2010-01-25 13:35 |
Fukuoka | Nishijin Plaza, Kyushu University | Enumerating Rooted and Triangulated Planar Graphs Bingbing Zhuang, Hiroshi Nagamochi (Kyoto Univ.) COMP2009-43 |
A graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces ... [more] |
COMP2009-43 pp.29-36 |
| COMP | 2010-01-25 14:10 |
Fukuoka | Nishijin Plaza, Kyushu University | Web Structure Mining on Isolated Cliques and Isolated Stars Contracted Webgraph Fumiya Oguri (Osaka Prefecture Univ.), Tatsuya Kiyotani (ASCOT Corp.), Yushi Uno (Osaka Prefecture Univ.) COMP2009-44 |
The link structure of the Web is generally viewed as the webgraph. Web structure mining aims to find hidden communities ... [more] | COMP2009-44 pp.37-44 |
| COMP | 2010-01-25 15:00 |
Fukuoka | Nishijin Plaza, Kyushu University | An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins Hiro Ito, Junichi Teruyama, Yuichi Yoshida (Kyoto Univ.) COMP2009-45 |
We investigate the following sorting puzzle: We are given $n$ bins with two balls in each bin. Balls in the $i$th bin ... [more] |
COMP2009-45 pp.45-49 |
| COMP | 2010-01-25 15:35 |
Fukuoka | Nishijin Plaza, Kyushu University | Minimum and maximum against k lies Michael Hoffmann (ETH Zurich), Jiri Matousek (Charles U/ETH Zurich), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (ETH Zurich) COMP2009-46 |
[more] | COMP2009-46 pp.51-56 |
| COMP | 2010-01-25 16:10 |
Fukuoka | Nishijin Plaza, Kyushu University | Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2009-47 |
A unate gate is a logical gate computing a unate Boolean function. Examples of unate gates are AND-gates, OR-gates, NO... [more] |
COMP2009-47 pp.57-64 |
| COMP | 2010-01-25 17:00 |
Fukuoka | Nishijin Plaza, Kyushu University | [Fellow Memorial Lecture]
Invited Talk as a New Fellow Masafumi Yamashita (Kyushu Univ) COMP2009-48 |
[more] | COMP2009-48 p.65 |
[Return to Top Page]