More Like this

1. Fast Multiparty Threshold ECDSA with Fast Trustless Setup

   https://doi.org/10.1145/3243734.3243859  

   Gennaro, Rosario ; Goldfeder, Steven ( October 2018 , ACM Conference on Computer and Communications Security)
2. FAST-PCA: A Fast and Exact Algorithm for Distributed Principal Component Analysis

   https://doi.org/10.1109/TSP.2022.3229635  

   Gang, Arpita ; Bajwa, Waheed U. ( January 2022 , IEEE Transactions on Signal Processing)
3. Fast BATLLNN: Fast Box Analysis of Two-Level Lattice Neural Networks

   https://doi.org/10.1145/3501710.3519533  

   Ferlez, James ; Khedr, Haitham ; Shoukry, Yasser ( May 2022 , 25th ACM International Conference on Hybrid Systems: Computation and Control)
4. A fast methodology for large-scale focusing inversion of gravity and magnetic data using the structured model matrix and the 2-D fast Fourier transform

   https://doi.org/10.1093/gji/ggaa372  

   Renaut, Rosemary A ; Hogue, Jarom D ; Vatankhah, Saeed ; Liu, Shuang ( November 2020 , Geophysical Journal International)

   null (Ed.)

   SUMMARY We discuss the focusing inversion of potential field data for the recovery of sparse subsurface structures from surface measurement data on a uniform grid. For the uniform grid, the model sensitivity matrices have a block Toeplitz Toeplitz block structure for each block of columns related to a fixed depth layer of the subsurface. Then, all forward operations with the sensitivity matrix, or its transpose, are performed using the 2-D fast Fourier transform. Simulations are provided to show that the implementation of the focusing inversion algorithm using the fast Fourier transform is efficient, and that the algorithm can be realized on standard desktop computers with sufficient memory for storage of volumes up to size n ≈ 106. The linear systems of equations arising in the focusing inversion algorithm are solved using either Golub–Kahan bidiagonalization or randomized singular value decomposition algorithms. These two algorithms are contrasted for their efficiency when used to solve large-scale problems with respect to the sizes of the projected subspaces adopted for the solutions of the linear systems. The results confirm earlier studies that the randomized algorithms are to be preferred for the inversion of gravity data, and for data sets of size m it is sufficient to use projected spaces of size approximately m/8. For the inversion of magnetic data sets, we show that it is more efficient to use the Golub–Kahan bidiagonalization, and that it is again sufficient to use projected spaces of size approximately m/8. Simulations support the presented conclusions and are verified for the inversion of a magnetic data set obtained over the Wuskwatim Lake region in Manitoba, Canada. 

   more » « less
5. Not so fast with fast funding

   https://doi.org/10.1080/08989621.2022.2129016  

   Holmes, Abigail ; Rubin, Hannah ( October 2022 , Accountability in Research)