Parallel Algorithms for and Applications of the Dense Canonical Polyadic Decomposition

Hayashi, Koby

Back to results

Wake Forest University

Parallel Algorithms for and Applications of the Dense Canonical Polyadic Decomposition

dc:creator Hayashi, Koby

dc:date.issued2018

Abstract

dc:description.abstract

Tensor decompositions have gained popularity in various research communities as a means of analyzing high dimensional, complex data.

Degree

thesis:*

Grantor dc:publisher: Wake Forest University
Year dc:date.issued: 2018

Author and committee

dc:creator, dc:contributor.*

Author dc:creator: Hayashi, Koby

Subjects

dc:subject × 1

CP Decomposition

Rights

Language dc:language.iso: en

Identifiers

dc:identifier.*

Handle dc:identifier.uri: http://hdl.handle.net/10339/90743
OAI identifier oai:identifier: oai:wakespace.lib.wfu.edu:10339/90743

Chain of custody

source

Harvested from: Wake Forest University
Base URL: wakespace.lib.wfu.edu/oai/request
Last updated: 2026-07-27
Source record: OAI-PMH GetRecord

related terms

citation

Hayashi, Koby. Parallel Algorithms for and Applications of the Dense Canonical Polyadic Decomposition. Wake Forest University, 2018. http://hdl.handle.net/10339/90743

Parallel Algorithms for and Applications of the Dense Canonical Polyadic Decomposition

Abstract

Degree

Author and committee

Subjects

Rights

Identifiers

Chain of custody

More from Wake Forest University