default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoki Ito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Tatsuya Hayashi
, Naoki Ito, Koji Tabata, Atsuyoshi Nakamura, Katsumasa Fujita, Yoshinori Harada, Tamiki Komatsuzaki:
Gaussian process classification bandits. Pattern Recognit. 149: 110224 (2024)- 2023
- [j7]Naoki Ito, Yukitoshi Sanada:
Gradient Descent Direction Random Walk MIMO Detection Using Intermediate Search Point. IEICE Trans. Commun. 106(11): 1192-1199 (2023) - [c4]Masaru Takeuchi, Katsuhiro Tokutake, Taichi Miyamoto, Naoki Ito, Tadayoshi Aoyama, Shigeru Kurimoto, Hitoshi Hirata, Yasuhisa Hasegawa:
Peripheral Nerve Block and Stimulation for Controlling Rat Ankle Joint Angle using Visual Feedback System. CBS 2023: 139-144 - 2022
- [i2]Yasuhiro Yao, Ryoichi Ishikawa, Shingo Ando, Kana Kurata, Naoki Ito, Jun Shimamura, Takeshi Oishi:
Non-learning Stereo-aided Depth Completion under Mis-projection via Selective Stereo Matching. CoRR abs/2210.01436 (2022) - [i1]Tatsuya Hayashi, Naoki Ito, Koji Tabata, Atsuyoshi Nakamura, Katsumasa Fujita, Yoshinori Harada, Tamiki Komatsuzaki:
Gaussian Process Classification Bandits. CoRR abs/2212.13157 (2022) - 2021
- [j6]Yasuhiro Yao, Ryoichi Ishikawa, Shingo Ando, Kana Kurata, Naoki Ito, Jun Shimamura, Takeshi Oishi:
Non-Learning Stereo-Aided Depth Completion Under Mis-Projection via Selective Stereo Matching. IEEE Access 9: 136674-136686 (2021)
2010 – 2019
- 2019
- [j5]Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh:
Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints. ACM Trans. Math. Softw. 45(3): 34:1-34:26 (2019) - 2018
- [j4]Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh:
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems. J. Glob. Optim. 72(4): 619-653 (2018) - 2017
- [j3]Naoki Ito, Akiko Takeda, Kim-Chuan Toh:
A Unified Formulation and Fast Accelerated Proximal Gradient Method for Classification. J. Mach. Learn. Res. 18: 16:1-16:49 (2017) - [j2]Shinsaku Sakaue, Akiko Takeda, Sunyoung Kim, Naoki Ito:
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems. SIAM J. Optim. 27(1): 565-582 (2017) - 2014
- [c3]Hiroyuki Arai, Naoki Ito, Yukinobu Taniguchi:
Surface Area Analysis for People Number Estimation. VISAPP (2) 2014: 86-93 - 2013
- [c2]Naoki Ito, Akiko Takeda, Toru Namerikawa:
Convex hull pricing for demand response in electricity markets. SmartGridComm 2013: 151-156
2000 – 2009
- 2004
- [c1]Yoshinori Kusachi, Akira Suzuki, Naoki Ito, Kenichi Arakawa:
Kanji Recognition in Scene Images without Detection of Text Fields - Robust Against Variation of Viewpoint, Contrast, and Background Texture. ICPR (1) 2004: 457-460 - 2003
- [j1]Keisuke Takebe, Naoki Ito, Shigeki Nakauchi, Shiro Usui:
Digital color imaging with color constancy. Syst. Comput. Jpn. 34(1): 79-88 (2003)
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 2025-03-04 22:30 CET 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:
