|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2007)
|
|
Search Results: Keywords 'from:2007-12-14 to:2007-12-14'
|
[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 |
2007-12-14 10:30 |
Hiroshima |
Hiroshima University |
Component Labeling for k-Concave Binary Images Using an FPGA Yasuaki Ito, Koji Nakano (Hiroshima Univ.) COMP2007-48 |
Connected component labeling is a task that assigns unique IDs to the connected components
of a binary (black and whit... [more] |
COMP2007-48 pp.1-8 |
COMP |
2007-12-14 11:05 |
Hiroshima |
Hiroshima University |
Winning Strategies for Hexagonal Polyomino Achievement Kazumine Inagaki, Akihiro Matsuura (Tokyo Denki Univ.) COMP2007-49 |
In polyomino achievement games, two players alternately mark the cells of a tessellation and try to
achieve a given po... [more] |
COMP2007-49 pp.9-15 |
COMP |
2007-12-14 14:15 |
Hiroshima |
Hiroshima University |
Synchronization in One-dimensional Cellular Automata Shigeru Ninagawa (KIT) COMP2007-50 |
Elementary (one-dimensional two-state three-neighbor) cellular automaton rule 60 and 90 exhibit a phenomenon in which th... [more] |
COMP2007-50 pp.17-21 |
COMP |
2007-12-14 14:50 |
Hiroshima |
Hiroshima University |
Evaluation of Hardware Algorithm Considering Wire Delay Tetsuya Nagase, Kazuyoshi Takagi, Naofumi Takagi (Nagoya Univ.) COMP2007-51 |
Computation time of hardware algorithms has been evaluated with the number of levels of the combinational circuit model.... [more] |
COMP2007-51 pp.23-28 |
COMP |
2007-12-14 15:25 |
Hiroshima |
Hiroshima University |
Computational Complexity of Initial-Value Problems with the Lipschitz Condition Akitoshi Kawamura (Toronto) COMP2007-52 |
We show, in answer to Ko's 1983 question, that an initial value problem given by a polynomial-time computable, Lipschitz... [more] |
COMP2007-52 pp.29-34 |
COMP |
2007-12-14 16:15 |
Hiroshima |
Hiroshima University |
Formulas on the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyahashi Univ. of Tech.) COMP2007-53 |
Let $N_{i}$ be the number of all connected spanning subgraphs
with $i(n-1\leq i\leq m)$ edges in an $n$-vertex $m$-edg... [more] |
COMP2007-53 pp.35-42 |
COMP |
2007-12-14 16:50 |
Hiroshima |
Hiroshima University |
An improvement of cuncurrent extensible hash tables to reduce contension costs Naoya Sueda, Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) COMP2007-54 |
We improve the split-ordered list hash algorithm(SOL) proposed by
Shalev and Nir that can process multiple operations c... [more] |
COMP2007-54 pp.43-50 |
|
|
|
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]
|