default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuo Aoyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Hiroshi Sawada
, Kazuo Aoyama, Kohei Ikeda:
Zeroth-Order Optimization of Optical Neural Networks with Linear Combination Natural Gradient and Calibrated Model. DAC 2024: 23:1-23:6- 2021
- [j7]Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda:
CPI-model-based analysis of sparse k-means clustering algorithms. Int. J. Data Sci. Anal. 12(3): 229-248 (2021) - [c12]Kazuo Aoyama, Hiroshi Sawada:
Acceleration Method for Learning Fine-Layered Optical Neural Networks. ICCAD 2021: 1-9 - [i3]Kazuo Aoyama, Kazumi Saito:
Structured Inverted-File k-Means Clustering for High-Dimensional Sparse Data. CoRR abs/2103.16141 (2021) - [i2]Kazuo Aoyama, Hiroshi Sawada:
Acceleration Method for Learning Fine-Layered Optical Neural Networks. CoRR abs/2109.01731 (2021) - 2020
- [i1]Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda:
Inverted-File k-Means Clustering: Performance Analysis. CoRR abs/2002.09094 (2020)
2010 – 2019
- 2019
- [c11]Hiroshi Sawada, Kazuo Aoyama:
Similarity Search-based Blind Source Separation. ICASSP 2019: 7888-7892 - 2018
- [j6]Yuki Yamagishi, Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda:
Pivot Generation Algorithm with a Complete Binary Tree for Efficient Exact Similarity Search. IEICE Trans. Inf. Syst. 101-D(1): 142-151 (2018) - [j5]Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda:
Accelerating a Lloyd-Type k-Means Clustering Algorithm with Summable Lower Bounds in a Lower-Dimensional Space. IEICE Trans. Inf. Syst. 101-D(11): 2773-2783 (2018) - 2017
- [j4]Yuki Yamagishi, Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda:
Efficient Similarity Search with a Pivot-Based Complete Binary Tree. IEICE Trans. Inf. Syst. 100-D(10): 2526-2536 (2017) - [j3]Takeshi Inomata, Flory Pinzón, José Luis Ranchos, Tsuyoshi Haraguchi, Hiroo Nasu, Juan Carlos Fernandez Diaz, Kazuo Aoyama, Hitoshi Yonenobu:
Archaeological Application of Airborne LiDAR with Object-Based Vegetation Classification and Visualization Techniques at the Lowland Maya Site of Ceibal, Guatemala. Remote. Sens. 9(6): 563 (2017) - 2016
- [c10]Takashi Hattori, Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda, Eri Kobayashi:
Pivot-based k-means Algorithm for Numerous-class Data Sets. SDM 2016: 333-341 - 2015
- [c9]Kazuo Aoyama, Atsunori Ogawa, Takashi Hattori, Takaaki Hori:
Double-layer neighborhood graph based similarity search for fast query-by-example spoken term detection. ICASSP 2015: 5216-5220 - 2014
- [j2]Tomohiro Warashina, Kazuo Aoyama, Hiroshi Sawada, Takashi Hattori:
Efficient K-Nearest Neighbor Graph Construction Using MapReduce for Large-Scale Data Sets. IEICE Trans. Inf. Syst. 97-D(12): 3142-3154 (2014) - [c8]Kazuo Aoyama, Atsunori Ogawa, Takashi Hattori, Takaaki Hori, Atsushi Nakamura:
Zero-resource spoken term detection using hierarchical graph-based similarity search. ICASSP 2014: 7093-7097 - 2013
- [c7]Kazuo Aoyama, Atsunori Ogawa, Takashi Hattori, Takaaki Hori, Atsushi Nakamura:
Graph index based query-by-example search on a large speech data set. ICASSP 2013: 8520-8524 - 2011
- [c6]Kazuo Aoyama, Kazumi Saito, Hiroshi Sawada, Naonori Ueda:
Fast approximate similarity search based on degree-reduced neighborhood graphs. KDD 2011: 1055-1063 - 2010
- [c5]Kazuo Aoyama, Shinji Watanabe, Hiroshi Sawada, Yasuhiro Minami, Naonori Ueda, Kazumi Saito:
Fast similarity search on a large speech data set with neighborhood graph indexing. ICASSP 2010: 5358-5361
2000 – 2009
- 2009
- [c4]Kazuo Aoyama, Kazumi Saito, Takeshi Yamada, Naonori Ueda:
Fast Similarity Search in Small-World Networks. CompleNet 2009: 185-196 - 2007
- [j1]Kazuo Aoyama:
Design Methods for Symmetric Function Generators Based on Threshold Elements. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(11): 1934-1946 (2007) - 2002
- [c3]Kazuo Aoyama, Hiroshi Sawada:
Threshold Element-Based Symmetric Function Generators and Their Functional Extension. FPL 2002: 1092-1096 - [c2]Kazuo Aoyama:
A reconfigurable logic circuit based on threshold elements with a controlled floating gate. ISCAS (5) 2002: 381-384 - 2000
- [c1]Kazuo Aoyama, Hiroshi Sawada, Akira Nagoya, Kazuo Nakajima:
A Threshold Logic-Based Reconfigurable Logic Element with a New Programming Technology. FPL 2000: 665-674
1990 – 1999
- 1993
- [p1]Hiroyuki Makimoto, Tadashi Ojiro, Mai Shiraishi, Takeshi Hoh, Kazuo Aoyama:
Development of a Screw Tightening Machine for Elastic Parts on Clean Room Environment. Robotics, Mechatronics and Manufacturing Systems 1993: 521-527
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-12-02 21:28 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:
