| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NLP, MSS | 2023-03-17 14:50 |
Nagasaki | (Primary: On-site, Secondary: Online) |
Reformulation of Optimization Problem in Randomized NMF and Proposal of A Novel Iterative Update Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  MSS2022-105 NLP2022-150 |
As an approach to efficiently perform large-scale Nonnegative Matrix Factorization (NMF), a randomized NMF was recently ... [more] | MSS2022-105 NLP2022-150 pp.204-209 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2021-06-28 14:15 |
Online | Online | Modification of Optimization Problem in Randomized NMF and Design of Optimization Method based on HALS Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NC2021-4 IBISML2021-4 |
Nonnegative matrix factorization (NMF) is the process of decomposing a given nonnegative matrix into two nonnegative fac... [more] | NC2021-4 IBISML2021-4 pp.23-30 |
| COMP | 2019-12-13 11:15 |
Gunma | Ikaho Seminar House, Gunma University | Computational complexity of satisfiability problem with exact number of solutions Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.) COMP2019-34 |
Valiant and Vazirani proved the isolation lemma for SAT to show a polynomial-time randomized reduction from SAT to Uniqu... [more] | COMP2019-34 pp.39-43 |
| IA | 2019-09-06 10:30 |
Hokkaido | Hokkaido Univ. Humanities and Social Sciences Classroom Bldg, W102 | Analysis of Two Random Walks on the Basis of Graph Spectrum
-- The Effect of Degree Heterogeneity on First Meeting Time on a Graph -- Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2019-18 |
The first meeting time is defined as the time required until multiple random walks starting from different nodes in a gr... [more] | IA2019-18 pp.39-44 |
| DC, SS | 2016-10-27 11:50 |
Shiga | Hikone Kinro-Fukushi Kaikan Bldg. | Faster Wait-free Randomized Consensus with an Oblivious Adversary for MRSW Register Model Sen Moriya (Kindai Univ.), Michiko Inoue (NAIST) SS2016-20 DC2016-22 |
We consider wait-free randomized consensus algorithms with an oblivious adversary in asynchronous shared-memory system u... [more] | SS2016-20 DC2016-22 pp.13-18 |
| COMP, IPSJ-AL | 2014-06-14 10:30 |
Ehime | Matsuyama, Ehime | On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo) COMP2014-12 |
Allender, Friedman, and Gasarch recently proved an upper bound of PSPACE for the class $DTTR_K$ of decidable language... [more] |
COMP2014-12 pp.77-83 |
| COMP | 2014-03-10 14:15 |
Tokyo | Randomized consensus algorithm using MRSW registers under oblivious adversary Satoru Nakajima, Michiko Inoue (NAIST) COMP2013-68 |
In this paper, we propose an efficient randomized consensus algorithm in distributed shared register model under an obli... [more] | COMP2013-68 pp.53-60 |
|
| COMP | 2012-10-31 13:30 |
Miyagi | Tohoku University | Pattern matching on compressed text using smaller space Takao Aihara, Ayumi Shinohara, Kazuyuki Narisawa (Tohoku Univ.) COMP2012-37 |
In this paper, we propose a randomized algorithm for pattern matching on strings represented by straight-line programs (... [more] | COMP2012-37 pp.17-24 |
| COMP | 2008-03-10 11:00 |
Kanagawa | An implementation and improvement of the sampling algorithm for digesting Fourier representations Masashi Yagitani, Yoshinori Takei (Nagaoka Univ. Tech.) COMP2007-58 |
A few frequency components of largest energy of a signal is useful as a digest data representing a feature of the signal... [more] | COMP2007-58 pp.23-30 |
|
[Return to Top Page]