|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2010)
|
|
Search Results: Keywords 'from:2010-05-19 to:2010-05-19'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP, IPSJ-AL |
2010-05-19 10:00 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
Voronoi Game on a Path Masashi Kiyomi (JAIST), Toshiki Saitoh (JST), Ryuhei Uehara (JAIST) COMP2010-10 |
The Voronoi game is a two-person perfect information game modeling a
competitive facility location. The original versio... [more] |
COMP2010-10 pp.1-5 |
COMP, IPSJ-AL |
2010-05-19 14:30 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
Efficient Pattern Matching for Acyclic Regular Expressions Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura (Hokkaido Univ.) COMP2010-11 |
A regular expression is \name{acyclic} if it is over the basis in $\Sigma$, dot ``$\cdot$'', and union ``$|$''. In this ... [more] |
COMP2010-11 pp.23-29 |
COMP, IPSJ-AL |
2010-05-19 15:05 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
Binary Image Processing with Limited Storage Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas, USA), Lilian Buzer (Univ. Paris-Est/LABINFO-IGM), David Kirkpatrick (Univ. of British Columbia) COMP2010-12 |
Removing noises in a given binary image is one of common
operations. A generalization of the operation is to erase
an... [more] |
COMP2010-12 pp.31-38 |
COMP, IPSJ-AL |
2010-05-19 15:55 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
On the t-pebbling number of weighted graphs Michael Hoffmann (Inst. of Theoretical Computer Sci, ETH Zurich), Jiri Matousek (Charles Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (Inst. of Theoretical Computer Sci, ETH Zurich) COMP2010-13 |
[more] |
COMP2010-13 pp.39-41 |
COMP, IPSJ-AL |
2010-05-19 16:30 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
Spanning tree congestion of k-outerplanar graphs Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.) COMP2010-14 |
In 1987, Simonson [Math. Syst. Theory 20 (1987) 235-252] conjectured that every k-outerplanar graph of the maximum degre... [more] |
COMP2010-14 pp.43-46 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|