Hiroshi Yoshida

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 Hirokazu Anai

> Home > Persons > Hiroshi Yoshida

Publications

2008
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/mics/YoshidaHA08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mics/YoshidaHA08
Hiroshi Yoshida, Katsuhisa Horimoto, Hirokazu Anai:
Inference of Probabilities over a Stochastic IL-System by Quantifier Elimination. Math. Comput. Sci. 1(3): 473-485 (2008)
2007
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/biosystems/YoshidaAH07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/biosystems/YoshidaAH07
Hiroshi Yoshida, Hirokazu Anai, Katsuhisa Horimoto:
Derivation of rigorous conditions for high cell-type diversity by algebraic approach. Biosyst. 90(2): 486-495 (2007)
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/ab/YoshidaNAH07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ab/YoshidaNAH07
Hiroshi Yoshida, Koji Nakagawa, Hirokazu Anai, Katsuhisa Horimoto:
Exact Parameter Determination for Parkinson's Disease Diagnosis with PET Using an Algebraic Approach. AB 2007: 110-124
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/casc/YoshidaNAH07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/casc/YoshidaNAH07
Hiroshi Yoshida, Koji Nakagawa, Hirokazu Anai, Katsuhisa Horimoto:
An Algebraic-Numeric Algorithm for the Model Selection in Kinetic Networks. CASC 2007: 433-447

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.