Hiroki Nomiya

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 Mamoru Kojima

> Home > Persons > Hiroki Nomiya

Publications

2014
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/iiaiaai/FunakiHNNK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iiaiaai/FunakiHNNK14
Kenta Funaki, Teruhisa Hochin, Hiroki Nomiya, Hideya Nakanishi, Mamoru Kojima:
Parallel Indexing Scheme for Data Intensive Applications. IIAI-AAI 2014: 630-635
2013
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/iiaiaai/FunakiHNNK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iiaiaai/FunakiHNNK13
Kenta Funaki, Teruhisa Hochin, Hiroki Nomiya, Hideya Nakanishi, Mamoru Kojima:
Parallel Indexing of Large Multi-dimensional Data. IIAI-AAI 2013: 324-329
2012
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/snpd/AzumaHNNK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/snpd/AzumaHNNK12
Ryohei Azuma, Teruhisa Hochin, Hiroki Nomiya, Hideya Nakanishi, Mamoru Kojima:
Towards Parallel Processing of Similarity Retrieval System of Time Series. SNPD 2012: 726-731
2009
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iih-msp/HochinYNNK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iih-msp/HochinYNNK09
Teruhisa Hochin, Yoshihiro Yamauchi, Hiroki Nomiya, Hideya Nakanishi, Mamoru Kojima:
Fast Subsequence Matching in Plasma Waveform Databases. IIH-MSP 2009: 759-762

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.