| 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-03-12 to:2010-03-12'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2010-03-12 09:05 |
Tokyo | National Institute of Informatics | NP-Completeness and Enumeration of Number Link Puzzle Kouichi Kotsuma, Yasuhiko Takenaga (Univ. of Electro-Comm.)  COMP2009-49 |
[more] | COMP2009-49 pp.1-7 |
| COMP | 2010-03-12 09:40 |
Tokyo | National Institute of Informatics | Bayesian Joint Optimization for Matrix Factorization and Clustering Tikara Hosino (Nihon Unisys, Ltd.) COMP2009-50 |
Statistical clustering is the method for dividing the given samples by assumed distributions. In high dimensional probl... [more] |
COMP2009-50 pp.9-12 |
| COMP | 2010-03-12 10:15 |
Tokyo | National Institute of Informatics | Note on Optimal Path for an Electric Vehicle Kimikazu Kato (Nihon Unisys, Ltd.) COMP2009-51 |
Main problems with an electric vehicle are its non-negligible time to charge a battery and that it runs only for a short... [more] | COMP2009-51 pp.13-17 |
| COMP | 2010-03-12 11:00 |
Tokyo | National Institute of Informatics | Deterministic Constant-Work-Space Algorithms for two dimensional Linear Programming Tetsuo Asano (JAIST), Danny Chen (Univ. of Notre Dame), Takeshi Tokuyama (Tohoku Univ.) COMP2009-52 |
[more] | COMP2009-52 pp.19-24 |
| COMP | 2010-03-12 11:35 |
Tokyo | National Institute of Informatics | On the Geodesic Diameter of Polygonal Domains Sang Won Bae (POSTECH), Matias Korman (Universite Libre de Broxelles, Belgium), Yoshio Okamoto (Tokyo Inst. of Tech.) COMP2009-53 |
[more] | COMP2009-53 pp.25-32 |
| COMP | 2010-03-12 13:20 |
Tokyo | National Institute of Informatics | On the standard local search for the independent set problem on d-claw free graphs Kazuyuki Kitayama, Toshihiro Fujito (Toyohashi Univ. of Tech.) COMP2009-54 |
The independent set problem in graphs is such an NP-hard problem that is known to be hard even to approximate effectiv... [more] |
COMP2009-54 pp.33-38 |
| COMP | 2010-03-12 13:55 |
Tokyo | National Institute of Informatics | Algorithm for detecting topological information in sensor network Ryota Narita, Takeshi Tokuyama (Tohoku Univ) COMP2009-55 |
We consider the hole detection problem in wireless sensor networks. The hole detection is important in network diagnosis... [more] | COMP2009-55 pp.39-45 |
| COMP | 2010-03-12 14:40 |
Tokyo | National Institute of Informatics | [Invited Talk]
Inverse Rendering for Computer Graphics Imari Sato (NII) COMP2009-56 |
[more] | COMP2009-56 p.47 |
| COMP | 2010-03-12 15:50 |
Tokyo | National Institute of Informatics | Online graph exploration algorithms for cycles and trees by multiple number of searchers Yuya Higashikawa, Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB) COMP2009-57 |
This paper deals with online graph exploration problems by multiple searchers. The purpose of search is to visit all ver... [more] | COMP2009-57 pp.49-56 |
| COMP | 2010-03-12 16:25 |
Tokyo | National Institute of Informatics | Time and Space Efficient Graph Exploration by a Mobile Agent Using Whiteboard Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2009-58 |
We consider the exploration problem with a single agent in undirected graphs. Starting from an arbitrary node, the agent... [more] | COMP2009-58 pp.57-64 |
[Return to Top Page]