default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunsuke Horii
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Shunsuke Horii, Yoichi Chikahara
:
Uncertainty Quantification in Heterogeneous Treatment Effect Estimation with Gaussian-Process-Based Partially Linear Model. AAAI 2024: 20420-20429- 2023
- [i6]Shunsuke Horii, Yoichi Chikahara:
Uncertainty Quantification in Heterogeneous Treatment Effect Estimation with Gaussian-Process-Based Partially Linear Model. CoRR abs/2312.10435 (2023) - 2021
- [c14]Shunsuke Horii:
Bayesian Model Averaging for Causality Estimation and its Approximation based on Gaussian Scale Mixture Distributions. AISTATS 2021: 955-963 - [i5]Shunsuke Horii:
Bayesian Model Averaging for Causality Estimation and its Approximation based on Gaussian Scale Mixture Distributions. CoRR abs/2103.08195 (2021) - 2020
- [c13]Shunsuke Horii:
Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate Values. ISIT 2020: 179-184 - [i4]Shunsuke Horii:
Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate Values. CoRR abs/2005.06118 (2020)
2010 – 2019
- 2019
- [c12]Shunsuke Horii, Tota Suko:
A Note on the Estimation Method of Intervention Effects based on Statistical Decision Theory. CISS 2019: 1-6 - [c11]Shunsuke Horii, Takahiro Yoshida, Manabu Kobayashi, Toshiyasu Matsushima:
Distributed Stochastic Gradient Descent Using LDGM Codes. ISIT 2019: 1417-1421 - [c10]Yuji Iikubo, Shunsuke Horii, Toshiyasu Matsushima:
Model Selection of Bayesian Hierarchical Mixture of Experts based on Variational Inference. SMC 2019: 3474-3479 - [i3]Shunsuke Horii, Takahiro Yoshida, Manabu Kobayashi, Toshiyasu Matsushima:
Distributed Stochastic Gradient Descent Using LDGM Codes. CoRR abs/1901.04668 (2019) - [i2]A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake:
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR abs/1907.02944 (2019) - 2018
- [c9]Kai Asaba, Shota Saito, Shunsuke Horii, Toshiyasu Matsushima:
Bayesian Independent Component Analysis under Hierarchical Model on Independent Components. APSIPA 2018: 959-962 - [c8]Shunsuke Horii:
Variational Bayesian Compressed Sensing for Sparse and Locally Constant Signals. APSIPA 2018: 972-976 - [c7]Yuji Iikubo, Shunsuke Horii, Toshiyasu Matsushima:
Sparse Bayesian Hierarchical Mixture of Experts and Variational Inference. ISITA 2018: 60-64 - 2016
- [j3]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channel. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2170-2178 (2016) - [c6]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
Linear programming decoding of binary linear codes for symbol-pair read channels. ISIT 2016: 1944-1948 - [c5]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
A note on support recovery of sparse signals using linear programming. ISITA 2016: 270-274 - 2015
- [i1]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels. CoRR abs/1508.01640 (2015) - 2014
- [c4]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
A note on the correlated multiple matrix completion based on the convex optimization method. SMC 2014: 1618-1623 - 2013
- [c3]Shunsuke Horii, Tota Suko, Toshiyasu Matsushima, Shigeichi Hirasawa:
Iterative multiuser joint decoding based on ADMM. GlobalSIP 2013: 1097-1100 - 2012
- [c2]Yuji Iikubo, Shunsuke Horii, Toshiyasu Matsushima:
The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference. ISITA 2012: 531-535 - [c1]Shunsuke Horii, Manabu Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa:
Fault diagnosis algorithm in multi-computer systems based on Lagrangian relaxation method. ISITA 2012: 712-716 - 2011
- [j2]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
A Note on the Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1230-1237 (2011) - 2010
- [j1]Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1912-1917 (2010)
Coauthor Index
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 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
