75 results on '"Ballard, Grey"'
Search Results
2. Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
3. General Memory-Independent Lower Bound for MTTKRP
4. Distributed-Memory Parallel JointNMF
5. Parallel Memory-Independent Communication Bounds for SYRK
6. CP decomposition for tensors via alternating least squares with QR decomposition
7. GentenMPI: Distributed Memory Sparse Tensor Decomposition
8. Randomized Algorithms for Rounding in the Tensor-Train Format
9. Generalized CP (GCP) Tensor Decompositions.
10. Brief Announcement
11. Parallel Tensor Train Rounding using Gram SVD
12. Parallel Algorithms for Tensor Train Arithmetic
13. Unsupervised Learning Through Randomized Algorithms for High-Volume High-Velocity Data (ULTRA-HV).
14. Visualizing Parallel Dynamic Programming using the Thread Safe Graphics Library
15. Accelerating Neural Network Training using Arbitrary Precision Approximating Matrix Multiplication Algorithms
16. Parallel Tucker Decomposition with Numerically Accurate SVD
17. PLANC
18. Parallel Hierarchical Clustering using Rank-Two Nonnegative Matrix Factorization
19. Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization
20. Reducing Computation and Communication in Scientific Computing: Connecting Theory to Practice.
21. Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
22. TuckerMPI
23. Parallel Tensor Compression for Large-Scale Scientific Data.
24. Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid
25. Contention Bounds for Combinations of Computation Graphs and Network Topologies
26. Joint 3D localization and classification of space debris using a multispectral rotating point spread function
27. The geometry of rank decompositions of matrix multiplication II: 3 × 3 matrices
28. Dynamic Functional Magnetic Resonance Imaging Connectivity Tensor Decomposition: A New Approach to Analyze and Interpret Dynamic Brain Connectivity
29. Parallel Nonnegative CP Decomposition of Dense Tensors
30. Communication Efficient Gaussian Elimination with Partial Pivoting using a Shape Morphing Data Layout
31. Communication Optimal Parallel Multiplication of Sparse Random Matrices
32. Partitioning and Communication Strategies for Sparse Non-negative Matrix Factorization
33. A 3D Parallel Algorithm for QR Decomposition
34. Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product
35. MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization
36. Shared-memory parallelization of MTTKRP for dense tensors
37. Shared-memory parallelization of MTTKRP for dense tensors
38. A Practical Randomized CP Tensor Decomposition
39. Dynamic functional connectivity and individual differences in emotions during social stress
40. A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem
41. Guest Editor Introduction PPoPP 2016, Special Issue 2 of 2
42. Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication
43. Parallel Tensor Compression for Large-Scale Scientific Data
44. A high-performance parallel algorithm for nonnegative matrix factorization
45. A high-performance parallel algorithm for nonnegative matrix factorization
46. Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid
47. Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
48. Improving the Numerical Stability of Fast Matrix Multiplication
49. Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search
50. Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.