default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoby Hayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Koby Hayashi, Sinan G. Aksoy, Grey Ballard, Haesun Park:
Randomized Algorithms for Symmetric Nonnegative Matrix Factorization. CoRR abs/2402.08134 (2024)- 2023
- [c6]Srinivas Eswar
, Benjamin Cobb, Koby Hayashi, Ramakrishnan Kannan, Grey Ballard, Richard W. Vuduc, Haesun Park:
Distributed-Memory Parallel JointNMF. ICS 2023: 301-312 - [d2]Srinivas Eswar, Benjamin Cobb, Koby Hayashi, Ramakrishnan Kannan, Grey Ballard, Rich Vuduc, Haesun Park:
AminerMag S Dataset. Zenodo, 2023
- [d1]Srinivas Eswar, Benjamin Cobb, Koby Hayashi, Ramakrishnan Kannan, Grey Ballard, Rich Vuduc, Haesun Park:
AminerMag X Dataset. Zenodo, 2023 - 2022
- [c5]Koby Hayashi, Sinan G. Aksoy, Haesun Park:
Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs. IEEE Big Data 2022: 555-564 - [i5]Koby Hayashi, Sinan G. Aksoy, Haesun Park:
Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs. CoRR abs/2203.01388 (2022) - 2021
- [j1]Srinivas Eswar, Koby Hayashi, Grey Ballard, Ramakrishnan Kannan, Michael A. Matheson, Haesun Park:
PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints. ACM Trans. Math. Softw. 47(3): 20:1-20:37 (2021) - 2020
- [c4]Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park, Haesun Park:
Hypergraph Random Walks, Laplacians, and Clustering. CIKM 2020: 495-504 - [c3]Srinivas Eswar, Koby Hayashi, Grey Ballard, Ramakrishnan Kannan, Richard W. Vuduc, Haesun Park:
Distributed-memory parallel symmetric nonnegative matrix factorization. SC 2020: 74 - [i4]Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park, Haesun Park:
Hypergraph Random Walks, Laplacians, and Clustering. CoRR abs/2006.16377 (2020)
2010 – 2019
- 2019
- [i3]Srinivas Eswar, Koby Hayashi, Grey Ballard, Ramakrishnan Kannan, Michael A. Matheson, Haesun Park:
PLANC: Parallel Low Rank Approximation with Non-negativity Constraints. CoRR abs/1909.01149 (2019) - 2018
- [c2]Grey Ballard, Koby Hayashi, Ramakrishnan Kannan:
Parallel Nonnegative CP Decomposition of Dense Tensors. HiPC 2018: 22-31 - [c1]Koby Hayashi, Grey Ballard, Yujie Jiang, Michael J. Tobia:
Shared-memory parallelization of MTTKRP for dense tensors. PPoPP 2018: 393-394 - [i2]Grey Ballard, Koby Hayashi, Ramakrishnan Kannan:
Parallel Nonnegative CP Decomposition of Dense Tensors. CoRR abs/1806.07985 (2018) - 2017
- [i1]Koby Hayashi, Grey Ballard, Jeffrey Jiang, Michael J. Tobia:
Shared Memory Parallelization of MTTKRP for Dense Tensors. CoRR abs/1708.08976 (2017)
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-11-08 20:33 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:
