default search action
Katsuki Fujisawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Keiichiro Yamamura, Issa Oe, Nozomi Hata, Hiroki Ishikura, Katsuki Fujisawa:
Appropriate Balance of Diversification and Intensification Improves Performance and Efficiency of Adversarial Attacks. Trans. Mach. Learn. Res. 2024 (2024) - [i4]Keiichiro Yamamura, Issa Oe, Hiroki Ishikura, Katsuki Fujisawa:
Enhancing Output Diversity Improves Conjugate Gradient-based Adversarial Attacks. CoRR abs/2408.03972 (2024) - 2023
- [c33]Issa Oe
, Keiichiro Yamamura
Superpixel Attack - Enhancing Black-Box Adversarial Attack with Image-Driven Division Areas. AI (1) 2023: 141-152 - 2022
- [j14]Satoshi Nakamura, Nariaki Tateiwa, Masaya Yasuda
Solving the search-LWE problem over projected lattices. Discret. Appl. Math. 318: 69-81 (2022) - [c32]Miyu Fujii, David Taingngin, Keiichiro Yamamura, Nozomi Hata, Hiroki Kai, Ryuji Noda, Hiroki Ishikura, Tatsuru Higurashi, Katsuki Fujisawa
Development and Evaluation of Embedding Methods for Graphs with Multi Attributes. IEEE Big Data 2022: 3659-3667 - [c31]Keiichiro Yamamura, Haruki Sato, Nariaki Tateiwa, Nozomi Hata, Toru Mitsutake, Issa Oe
Diversified Adversarial Attacks based on Conjugate Gradient Method. ICML 2022: 24872-24894 - [i3]Keiichiro Yamamura, Haruki Sato, Nariaki Tateiwa, Nozomi Hata, Toru Mitsutake, Issa Oe, Hiroki Ishikura, Katsuki Fujisawa
Diversified Adversarial Attacks based on Conjugate Gradient Method. CoRR abs/2206.09628 (2022) - 2021
- [c30]Huiqiao Ren, Katsuki Fujisawa
G2 B-Spline Computation for Continuous Trajectory Generation. ACIRS 2021: 1-7 - [c29]Akira Tanaka, Chansu Han, Takeshi Takahashi, Katsuki Fujisawa
Internet-Wide Scanner Fingerprint Identifier Based on TCP/IP Header. FMEC 2021: 1-6 - [c28]Nariaki Tateiwa, Yuji Shinano
CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems. HiPC 2021: 42-52 - [c27]Huiqiao Ren, Fulin Zhou, Katsuki Fujisawa
Real-Time Automatic Anomaly Detection Approach Designed for Electrified Railway Power System. ICMRE 2021: 116-120 - [c26]Masahiro Nakao
Performance of the Supercomputer Fugaku for Breadth-First Search in Graph500 Benchmark. ISC 2021: 372-390 - [i2]Akihiro Yoshida, Haruki Sato, Shiori Uchiumi, Nariaki Tateiwa, Daisuke Kataoka, Akira Tanaka, Nozomi Hata, Yosuke Yatsushiro, Ayano Ide, Hiroki Ishikura, Shingo Egi, Miyu Fujii, Hiroki Kai, Katsuki Fujisawa:
Long-Term Optimal Delivery Planning for Replacing the Liquefied Petroleum Gas Cylinder. CoRR abs/2112.12530 (2021) - 2020
- [j13]Akihiro Yoshida
New Performance Index "Attractiveness Factor" for Evaluating Websites via Obtaining Transition of Users' Interests. Data Sci. Eng. 5(1): 48-64 (2020) - [c25]Masahiro Nakao, Koji Ueno, Katsuki Fujisawa
Performance Evaluation of Supercomputer Fugaku using Breadth-First Search Benchmark in Graph500. CLUSTER 2020: 408-409 - [c24]Satoshi Nakamura, Nariaki Tateiwa, Koha Kinjo, Yasuhiko Ikematsu, Masaya Yasuda, Katsuki Fujisawa
Solving the Search-LWE Problem by Lattice Reduction over Projected Bases. ICMC 2020: 29-42 - [c23]Nozomi Hata, Shizuo Kaji, Akihiro Yoshida, Katsuki Fujisawa:
Nested Subspace Arrangement for Representation of Relational Data. ICML 2020: 4127-4137 - [c22]Nariaki Tateiwa, Yuji Shinano, Satoshi Nakamura, Akihiro Yoshida, Shizuo Kaji, Masaya Yasuda, Katsuki Fujisawa
Massive parallelization for finding shortest lattice vectors based on ubiquity generator framework. SC 2020: 60 - [i1]Nozomi Hata, Shizuo Kaji, Akihiro Yoshida, Katsuki Fujisawa:
Nested Subspace Arrangement for Representation of Relational Data. CoRR abs/2007.02007 (2020)
2010 – 2019
- 2019
- [c21]Akihiro Yoshida, Yosuke Yatsushiro, Nozomi Hata, Tatsuru Higurashi, Nariaki Tateiwa, Takashi Wakamatsu, Akira Tanaka, Kenichi Nagamatsu, Katsuki Fujisawa
Practical End-to-End Repositioning Algorithm for Managing Bike-Sharing System. IEEE BigData 2019: 1251-1258 - 2018
- [j12]Satoshi Imamura
Evaluating Energy-Efficiency of DRAM Channel Interleaving Schemes for Multithreaded Programs. IEICE Trans. Inf. Syst. 101-D(9): 2247-2257 (2018) - [c20]Nozomi Hata, Takashi Nakayama, Akira Tanaka, Takashi Wakamatsu, Akihiro Yoshida, Nariaki Tateiwa, Yuri Nishikawa
Mobility Optimization on Cyber Physical System via Multiple Object Tracking and Mathematical Programming. IEEE BigData 2018: 4026-4035 - 2017
- [j11]Koji Ueno, Toyotaro Suzumura, Naoya Maruyama, Katsuki Fujisawa
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines. Data Sci. Eng. 2(1): 22-35 (2017) - [c19]Akira Tanaka, Nozomi Hata, Nariaki Tateiwa, Katsuki Fujisawa
Practical approach to evacuation planning via network flow and deep learning. IEEE BigData 2017: 3368-3377 - 2016
- [c18]Satoshi Imamura
Evaluating the impacts of code-level performance tunings on power efficiency. IEEE BigData 2016: 362-369 - [c17]Koji Ueno, Toyotaro Suzumura, Naoya Maruyama, Katsuki Fujisawa
Extreme scale breadth-first search on supercomputers. IEEE BigData 2016: 1040-1047 - [c16]Yuichiro Yasui, Katsuki Fujisawa
NUMA-aware Scalable Graph Traversal on SGI UV Systems. HPGP@HPDC 2016: 19-26 - [c15]Katsuki Fujisawa
Advanced Computing and Optimization Infrastructure for Extremely Large-Scale Graphs on Post Peta-Scale Supercomputers. ICMS 2016: 265-274 - [c14]Satoshi Imamura
Power-Efficient Breadth-First Search with DRAM Row Buffer Locality-Aware Address Mapping. HPGDMP@SC 2016: 17-24 - 2015
- [c13]Yuichiro Yasui, Katsuki Fujisawa
Fast and scalable NUMA-based thread parallel breadth-first search. HPCS 2015: 377-385 - [c12]Yuki Tsujita, Toshio Endo, Katsuki Fujisawa
The scalable petascale data-driven approach for the Cholesky factorization with multiple GPUs. ESPM@SC 2015: 38-45 - 2014
- [c11]Keita Iwabuchi, Hitoshi Sato, Yuichiro Yasui, Katsuki Fujisawa
NVM-based Hybrid BFS with memory efficient data structure. IEEE BigData 2014: 529-538 - [c10]Katsuki Fujisawa
Petascale General Solver for Semidefinite Programming Problems with Over Two Million Constraints. IPDPS 2014: 1171-1180 - [c9]Keita Iwabuchi, Hitoshi Sato
Hybrid BFS Approach Using Semi-external Memory. IPDPS Workshops 2014: 1698-1707 - [c8]Yuichiro Yasui, Katsuki Fujisawa
Fast and Energy-efficient Breadth-First Search on a Single NUMA System. ISC 2014: 365-381 - 2013
- [c7]Yuichiro Yasui, Katsuki Fujisawa
NUMA-optimized parallel breadth-first search on multicore single-node system. IEEE BigData 2013: 394-402 - 2012
- [j10]Makoto Yamashita
Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix. ACM Trans. Math. Softw. 39(1): 6:1-6:22 (2012) - [c6]Katsuki Fujisawa
High-performance general solver for extremely large-scale semidefinite programming problems. SC 2012: 93 - 2011
- [c5]Toyotaro Suzumura, Koji Ueno, Hitoshi Sato, Katsuki Fujisawa
Performance characteristics of Graph500 on large-scale distributed environment. IISWC 2011: 149-158 - 2010
- [c4]Makoto Yamashita, Katsuki Fujisawa
Efficient parallel software for large-scale Semidefinite Programs. CACSD 2010: 1-6
2000 – 2009
- 2006
- [j9]Takayuki Gunji, Sunyoung Kim, Katsuki Fujisawa
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing 77(4): 387-411 (2006) - [j8]Katsuki Fujisawa
Preprocessing sparse semidefinite programs via matrix completion. Optim. Methods Softw. 21(1): 17-39 (2006) - [j7]Kazuhide Nakata, Makoto Yamashita
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion. Parallel Comput. 32(1): 24-43 (2006) - 2004
- [j6]Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa
PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing 73(1): 57-77 (2004) - [c3]Katsuki Fujisawa
High Performance Grid and Cluster Computing for Some Optimization Problems. SAINT Workshops 2004: 612-615 - 2003
- [j5]Kazuhide Nakata, Katsuki Fujisawa
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. Math. Program. 95(2): 303-327 (2003) - [j4]Makoto Yamashita
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0). Optim. Methods Softw. 18(4): 491-505 (2003) - [j3]Makoto Yamashita
SDPARA: SemiDefinite Programming Algorithm paRAllel version. Parallel Comput. 29(8): 1053-1067 (2003) - 2002
- [j2]Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima:
Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems. J. Glob. Optim. 24(2): 237-260 (2002) - 2000
- [c2]Bernard Champoux, Katsuki Fujisawa, Tomoyoshi Inoue, Yuichi Iwadate:
Transmitting Visual Information: Icons Become Words. IV 2000: 244-249
1990 – 1999
- 1999
- [c1]Katsuki Fujisawa
Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. Discovery Science 1999: 148-159 - 1997
- [j1]Katsuki Fujisawa
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Math. Program. 79: 235-253 (1997)
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-09-14 23:52 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: