IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
SP 2010-11-18
10:30		 Aichi Aichi Prefectural Univ. Acoustic Analysis of English and Japanese Stop Voicing Contrasts by Korean L2 Learners
Katsumasa Shimizu (Nagoya Gakuin U.) SP2010-69		 The present study examines phonetic characteristics of Korean L2 learners’ speech, when they produce English and Japanes... [more] SP2010-69
pp.1-5
COMP 2008-09-11
09:30		 Aichi Nagoya Inst. of Tech. Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) COMP2008-24		 Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs
in an $n$-vertex $m$-edge undirected graph $... [more]		 COMP2008-24
pp.9-16
COMP 2008-06-16
15:35		 Ishikawa JAIST Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}-e$, $K_{n}\cdot e$
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech) COMP2008-21		 Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs
in an $n$-vertex $m$-edge undirected graph $... [more]		 COMP2008-21
pp.43-48
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-09-20
16:25		 Aichi   A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an $n$-Vertex Graph with at Least $\bigl\lceil(3-2\sqrt{2})n^2+n-\frac{7-2\sqrt{2}}{2\sqrt{2}}\bigr\rceil$ Edges
Peng Cheng (Nagoya Gakuin Univ), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2007-40		 Consider an undirected simple graph $G=(V,E)$ with $n$ vertices and $m$ edges, and let $N_{i}$ be the number of connecte... [more] COMP2007-40
pp.59-66
 Results 1 - 5 of 5  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan