|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
BioX, ITE-ME, ITE-IST [detail] |
2019-06-07 14:00 |
Ishikawa |
Kanazawa University |
Statistical Evaluation for Deviation and Unifomity of Biometric Bit-string feature Rikuhiro Kojima, Hajime Nada, Hidetsugu Uchida, Tomoaki Matsunami, Narishige Abe (FLL) BioX2019-3 |
In the field of online biometric authentication, there are some issues for convenience and security, for example, biomet... [more] |
BioX2019-3 pp.55-59 |
CPSY, DC, IPSJ-ARC (Joint) [detail] |
2015-08-06 13:30 |
Oita |
B-Con Plaza (Beppu) |
Parallelization of Approximate String Matching Based on Computation of Prefix Sums Yasuaki Mitani, Fumihiko Ino, Kenichi Hagihara (Osaka Univ.) CPSY2015-39 |
In this paper, aiming at accelerating string search, we propose a parallel method for a shift-or algorithm. Our method a... [more] |
CPSY2015-39 pp.229-234 |
IPSJ-SLDM, CPSY, RECONF, VLD [detail] |
2014-01-29 08:30 |
Kanagawa |
Hiyoshi Campus, Keio University |
An Experimental Bit-Parallel Solution to Accelerate Smith-Waterman Algorithm Saori Sudo, Masato Yoshimi, Hidetsugu Irie, Tsutomu Yoshinaga (UEC) VLD2013-119 CPSY2013-90 RECONF2013-73 |
The Smith-Waterman (SW) algorithm is a computational method to obtain well accorded subsequences between two strings, an... [more] |
VLD2013-119 CPSY2013-90 RECONF2013-73 pp.103-108 |
COMP |
2012-09-03 10:05 |
Tokyo |
Hosei University |
Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech.) COMP2012-27 |
This paper is concerned with the following regular expression searching
problem which, given a regular expression $r$ ... [more] |
COMP2012-27 pp.9-16 |
COMP, IPSJ-AL |
2011-09-06 14:50 |
Hokkaido |
Hakodate City Central Library |
Extended Pseudo-tree Pattern Matching with labels of strings Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT) COMP2011-25 |
Given two unordered labeled trees P and T , the tree pattern matching problem for unordered labeled trees is to find all... [more] |
COMP2011-25 pp.53-60 |
ICD |
2005-04-14 16:15 |
Fukuoka |
|
4Gb Multilevel AG-AND Flash Memory with 10MB/s Programming Throughput Hideaki Kurata, Yoshitaka Sasago, Kazuo Otsuga, Tsuyoshi Arigane, Tetsufumi Kawamura, Takashi Kobayashi, Hitoshi Kume (Hitachi), Kazuki Homma, Kenji Kozakai, Satoshi Noda, Teruhiko Ito, Masahiro Shimizu, Yoshihiro Ikeda, Osamu Tsuchiya, Kazunori Furusawa (RENESAS) |
We fabricated a 4Gb multilevel AG-AND flash memory using 90nm CMOS technology. By using an inversion-layer local-bitline... [more] |
ICD2005-11 pp.53-58 |
|
|
|
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]
|