E-LIB Suche - Ergebnisse für: Solomonik, Edgar

1

Minimum Cost Loop Nests for Contraction of a Sparse Tensor ..:

, In: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures,

Kanakagiri, Raghavendra ; Solomonik, Edgar - p. 169-181 , 2024

Link: https://dl.acm.org/doi/1..

2

Codebase release 1.3 for SymTensor:

Gao, Yang ; Helms, Phillip ; Chan, Garnet Kin-Lic.
SciPost Physics Codebases. , 2023

Link: https://doi.org/10.21468..

3

Accelerating Sparse Data Orchestration via Dynamic Reflexiv..:

, In: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3,

Odemuyiwa, Toluwanimi O. ; Asghari-Moghaddam, Hadi ; Pellauer, Michael... - p. 18-32 , 2023

Link: https://dl.acm.org/doi/1..

4

Automatic transformation of irreducible representations for..:

Gao, Yang ; Helms, Phillip ; Chan, Garnet Kin-Lic.
SciPost Physics Codebases. , 2023

Link: https://doi.org/10.21468..

5

Communication Lower Bounds for Nested Bilinear Algorithms v..:

Ju, Caleb ; Zhang, Yifan ; Solomonik, Edgar
Foundations of Computational Mathematics. , 2023

Link: https://doi.org/10.1007/..

6

Application Performance Modeling via Tensor Completion:

, In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis,

Hutter, Edward ; Solomonik, Edgar - p. 1-14 , 2023

Link: https://dl.acm.org/doi/1..

7

Optimal Round and Sample-Size Complexity for Partitioning i..:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,

Yang, Wentao ; Harsh, Vipul ; Solomonik, Edgar - p. 467-478 , 2023

Link: https://dl.acm.org/doi/1..

8

Alternating Mahalanobis Distance Minimization for Accurate ..:

Singh, Navjot ; Solomonik, Edgar
SIAM Journal on Scientific Computing. 45 (2023) 6 - p. A2781-A2812 , 2023

Link: https://doi.org/10.1137/..

9

Accelerating Sparse Data Orchestration via Dynamic Reflexiv..:

, In: Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing,

Odemuyiwa, Toluwanimi O. ; Asghari-Moghaddam, Hadi ; Pellauer, Michael... - p. 15-16 , 2023

Link: https://dl.acm.org/doi/1..

10

Optimizing Distributed Tensor Contractions Using Node-Aware..:

, In: Euro-Par 2023: Parallel Processing; Lecture Notes in Computer Science,

Irmler, Andreas ; Kanakagiri, Raghavendra ; Ohlmann, Sebastian T... - p. 710-724 , 2023

Link: https://doi.org/10.1007/..

11

Distributed-memory tensor completion for generalized loss f..:

Singh, Navjot ; Zhang, Zecheng ; Wu, Xiaoxiao...
Journal of Parallel and Distributed Computing. 169 (2022) - p. 269-285 , 2022

Link: https://doi.org/10.1016/..

12

Accelerating alternating least squares for tensor decomposi..:

Ma, Linjian ; Solomonik, Edgar
Numerical Linear Algebra with Applications. 29 (2022) 4 - p. , 2022

Link: https://doi.org/10.1002/..

13

Efficient Preconditioners for Interior Point Methods via a ..:

Karim, Samah ; Solomonik, Edgar
SIAM Journal on Matrix Analysis and Applications. 43 (2022) 4 - p. 1680-1711 , 2022

Link: https://doi.org/10.1137/..

14

Communication Lower Bounds of Bilinear Algorithms for Symme..:

Solomonik, Edgar ; Demmel, James ; Hoefler, Torsten
SIAM Journal on Scientific Computing. 43 (2021) 5 - p. A3328-A3356 , 2021

Link: https://doi.org/10.1137/..

15

Comparison of Accuracy and Scalability of Gauss--Newton and..:

Singh, Navjot ; Ma, Linjian ; Yang, Hongru.
SIAM Journal on Scientific Computing. 43 (2021) 4 - p. C290-C311 , 2021

Link: https://doi.org/10.1137/..