Parallel Matrix Factorization
Parallel Matrix Factorization is a computational method in numerical linear algebra that decomposes a matrix into constituent factors by simultaneously leveraging multiple processing units to accelerate the factorization process, thereby distinguishing it from sequential matrix factorization techniques through its inherent concurrency and distributed workload management.
324
Publications
16.7K
Citations
708
Authors
311
Institutions
Publications per year
2017–2026
52
324
SOLOv2: Dynamic and Fast Instance Segmentation
Xinlong Wang, Rufeng Zhang, Tao Kong et al. · arXiv (Cornell University) · 2020 · 478 citations · Full text
1–5 of 324
708
15
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 708
311
University of Tennessee at Knoxville
Knoxville, United States
16 h-index
52 publications
2.2K citations

Oak Ridge National Laboratory
Oak Ridge, United States
14 h-index
18 publications
919 citations
Stanford University
Stanford, United States
11 h-index
21 publications
996 citations
The University of Texas at Austin
Austin, United States
9 h-index
24 publications
3K citations

University of Manchester
Manchester, United Kingdom
8 h-index
8 publications
183 citations

École Normale Supérieure de Lyon
Lyon, France
8 h-index
12 publications
252 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
8 publications
725 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
11 publications
372 citations
1–8 of 311
17 publications · 542 citations
14
h-index
Repository · 10 publications · 825 citations
10
h-index
10 publications · 839 citations
10
h-index
9 publications · 391 citations
9
h-index
TOMS · 7 publications · 267 citations
7
h-index
1–5