2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DC2022
Efficient, Out-of-Memory Sparse MTTKRP on Massively Parallel Architectures
Andy Nguyen, Ahmed E. Helal, Fabio Checconi +6
Tensor decomposition (TD) is an important method for extracting latent information from high-dimensional (multi-modal) sparse data. This study presents a novel framework for accele…
cs.DS2012★ 2 cited
Solving Cyclic Longest Common Subsequence in Quadratic Time
Andy Nguyen
We present a practical algorithm for the cyclic longest common subsequence (CLCS) problem that runs in O(mn) time, where m and n are the lengths of the two input strings. While thi…