![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Hiroshige Inazumi
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c7]Shigeichi Hirasawa, Gendo Kumoi, Hideki Yagi, Manabu Kobayashi, Masayuki Goto, Hiroshige Inazumi:
Construction Methods for Error Correcting Output Codes Using Constructive Coding and Their System Evaluations. SMC 2022: 3053-3059
2010 – 2019
- 2019
- [c6]Shigeichi Hirasawa, Gendo Kumoi, Hideki Yagi, Manabu Kobayashi, Masayuki Goto
, Tetsuya Sakai, Hiroshige Inazumi:
System Evaluation of Ternary Error-Correcting Output Codes for Multiclass Classification Problems. SMC 2019: 2893-2898 - 2018
- [c5]Shigeichi Hirasawa, Gendo Kumoi, Manabu Kobayashi, Masayuki Goto
, Hiroshige Inazumi:
System Evaluation of Construction Methods for Multi-class Problems Using Binary Classifiers. WorldCIST (2) 2018: 909-919 - 2011
- [c4]Tomohiko Saito, Hiroshige Inazumi, Toshiyasu Matsushima, Shigeichi Hirasawa:
Disk allocation methods for Cartesian product files using unequal error protection codes. SMC 2011: 2437-2442 - [c3]Shigeichi Hirasawa, Tomohiko Saito, Hiroshige Inazumi, Toshiyasu Matsushima:
System evaluation of disk allocation methods for Cartesian product files by using error correcting codes. SMC 2011: 2443-2448
1990 – 1999
- 1997
- [c2]Ransui Iso, Hiroshige Inazumi:
A Multi-layered Planning Architecture for Soccer Agent. RoboCup 1997: 513-518 - 1994
- [j6]Toshimitsu Kaneko, Toshihisa Nishijima, Hiroshige Inazumi, Shigeichi Hirasawa:
An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder. IEEE Trans. Inf. Theory 40(2): 320-327 (1994) - 1993
- [j5]Toshiyasu Matsushima, Hiroshige Inazumi, Shigeichi Hirasawa:
An inductive inference procedure to minimize prediction error. IEEE Trans. Syst. Man Cybern. 23(2): 547-554 (1993) - 1991
- [j4]Toshiyasu Matsushima, Hiroshige Inazumi, Shigeichi Hirasawa:
A class of distortionless codes designed by Bayes decision theory. IEEE Trans. Inf. Theory 37(5): 1288-1293 (1991)
1980 – 1989
- 1989
- [j3]Hiroshige Inazumi, Masaki Kochiya, Shigeichi Hirasawa:
On the trade-offs between the file redundancy and the communication costs in distributed database systems. IEEE Trans. Syst. Man Cybern. 19(1): 108-112 (1989) - 1987
- [j2]Hiroshige Inazumi, Shigeichi Hirasawa:
On Analyses of the Modified Versions of the Consecutive Retrieval File Organization. IEEE Trans. Syst. Man Cybern. 17(2): 222-228 (1987) - 1985
- [c1]Hiroshige Inazumi, Shigeichi Hirasawa:
On the Relaxed Consecutive Retrieval Property in File Organization. FODO 1985: 103-112 - 1984
- [j1]Hiroshige Inazumi, Shigeichi Hirasawa:
Memory versus error trade-offs in binary-valued retrieval problems. IEEE Trans. Syst. Man Cybern. 14(5): 780-784 (1984)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint