Satoru Tsuge

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yasue Mitsukura

> Home > Persons > Satoru Tsuge

Publications

2009
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/iconip/OyamaCKTMF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iconip/OyamaCKTMF09
Tadahiro Oyama, Hillary Kipsang Choge, Stephen Karungaru, Satoru Tsuge, Yasue Mitsukura, Minoru Fukumi:
Improvement Algorithm for Approximate Incremental Learning. ICONIP (1) 2009: 520-529
2008
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/ijcnn/NakanoKTAMF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcnn/NakanoKTAMF08
Miyoko Nakano, Stephen Karungaru, Satoru Tsuge, Takuya Akashi, Yasue Mitsukura, Minoru Fukumi:
Face information processing by fast statistical learning algorithm. IJCNN 2008: 3229-3232
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/kes/OyamaKTMF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kes/OyamaKTMF08
Tadahiro Oyama, Stephen Karungaru, Satoru Tsuge, Yasue Mitsukura, Minoru Fukumi:
Incremental Learning Method of Simple-PCA. KES (2) 2008: 403-410
2007
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/kes/FukumiKTNAM07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kes/FukumiKTNAM07
Minoru Fukumi, Stephen Karungaru, Satoru Tsuge, Miyoko Nakano, Takuya Akashi, Yasue Mitsukura:
Fast Statistical Learning Algorithm for Feature Generation. KES (3) 2007: 91-97

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.