ResearchTrend.AI
Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Arvind V. Mahankali
David P. Woodruff
Ziyun Zhang
ArXivPDFHTML

Papers citing "Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions"

2 / 2 papers shown
Title
Tensorized Random Projections
Tensorized Random Projections
Beheshteh T. Rakhshan
Guillaume Rabusseau
28
22
0
11 Mar 2020
Low-Rank Tucker Approximation of a Tensor From Streaming Data
Low-Rank Tucker Approximation of a Tensor From Streaming Data
Yiming Sun
Yang Guo
Charlene Luo
J. Tropp
Madeleine Udell
44
71
0
24 Apr 2019

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.