Výsledky vyhľadávania - "Sketching algorithms"
-
1
Statistical properties of sketching algorithms
ISSN: 0006-3444Vydavateľské údaje: England 01.06.2021Vydané v Biometrika (01.06.2021)“… Numerical operations on big datasets can be intolerably slow; sketching algorithms address this issue by generating a smaller surrogate dataset…”
Zistit podrobnosti o prístupe
Journal Article -
2
Practical Sketching Algorithms for Low-Rank Matrix Approximation
ISSN: 0895-4798, 1095-7162Vydavateľské údaje: 01.01.2017Vydané v SIAM journal on matrix analysis and applications (01.01.2017)Získať plný text
Journal Article -
3
Statistical inference for sketching algorithms
ISSN: 2049-8772Vydavateľské údaje: Oxford University Press 04.09.2024Vydané v Information and Inference: A Journal of the IMA (04.09.2024)“…Sketching algorithms use random projections to generate a smaller sketched data set, often for the purposes of modelling…”
Získať plný text
Journal Article -
4
Sketching algorithms for genomic data analysis and querying in a secure enclave
ISSN: 1548-7091, 1548-7105, 1548-7105Vydavateľské údaje: New York Nature Publishing Group US 01.03.2020Vydané v Nature methods (01.03.2020)“…Genome-wide association studies (GWAS), especially on rare diseases, may necessitate exchange of sensitive genomic data between multiple institutions. Since…”
Získať plný text
Journal Article -
5
On randomized sketching algorithms and the Tracy–Widom law
ISSN: 0960-3174, 1573-1375Vydavateľské údaje: New York Springer US 01.02.2023Vydané v Statistics and computing (01.02.2023)“… These algorithms are often referred to as sketching algorithms, as the projected dataset can be used as a compressed representation of the full dataset…”
Získať plný text
Journal Article -
6
When the levee breaks: a practical guide to sketching algorithms for processing the flood of genomic data
ISSN: 1474-760X, 1474-7596, 1474-760XVydavateľské údaje: London BioMed Central 13.09.2019Vydané v Genome Biology (13.09.2019)“… Sketching algorithms produce small, approximate summaries of data and have shown great utility in tackling this flood of genomic data, while using minimal compute resources…”
Získať plný text
Journal Article -
7
Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors
ISSN: 0885-7474, 1573-7691Vydavateľské údaje: New York Springer US 01.05.2023Vydané v Journal of scientific computing (01.05.2023)“…Low-rank approximation of tensors has been widely used in high-dimensional data analysis. It usually involves singular value decomposition (SVD) of large-scale…”
Získať plný text
Journal Article -
8
Improving compressed matrix multiplication using control variate method
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Elsevier B.V 01.01.2025Vydané v Information processing letters (01.01.2025)“…The seminal work by Pagh [1] proposed a matrix multiplication algorithm for real-valued squared matrices called Compressed Matrix Multiplication (CMM) having a…”
Získať plný text
Journal Article -
9
Sparsifying Count Sketch
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Elsevier B.V 01.08.2024Vydané v Information processing letters (01.08.2024)“…The seminal work of Charikar et al. [1] called Count-Sketch suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation…”
Získať plný text
Journal Article -
10
Differentially-Private Multi-Party Sketching for Large-Scale Statistics
ISSN: 2299-0984, 2299-0984Vydavateľské údaje: Sciendo 01.07.2020Vydané v Proceedings on Privacy Enhancing Technologies (01.07.2020)“… To support large-scale analytics we investigate how this privacy can be provided for the case of sketching algorithms running in time sub-linear of the input size…”
Získať plný text
Journal Article -
11
Statistical inference for sketching algorithms
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 06.06.2023Vydané v arXiv.org (06.06.2023)“…Sketching algorithms use random projections to generate a smaller sketched data set, often for the purposes of modelling…”
Získať plný text
Paper -
12
FastANI, Mash and Dashing equally differentiate between Klebsiella species
ISSN: 2167-8359, 2167-8359Vydavateľské údaje: United States PeerJ, Inc 21.07.2022Vydané v PeerJ (San Francisco, CA) (21.07.2022)“…Bacteria of the genus Klebsiella are among the most important multi-drug resistant human pathogens, though they have been isolated from a variety of…”
Získať plný text
Journal Article -
13
Low Rank Approximation and Decomposition of Large Matrices Using Error Correcting Codes
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.09.2017Vydané v IEEE transactions on information theory (01.09.2017)“… Recently, randomized sketching algorithms were proposed to effectively construct low rank approximations and obtain approximate singular value decompositions of large matrices…”
Získať plný text
Journal Article -
14
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 29.10.2023Vydané v arXiv.org (29.10.2023)“…Sketching algorithms have recently proven to be a powerful approach both for designing low-space streaming algorithms as well as fast polynomial time approximation schemes (PTAS…”
Získať plný text
Paper -
15
Surrogate-based Autotuning for Randomized Sketching Algorithms in Regression Problems
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 30.08.2023Vydané v arXiv.org (30.08.2023)“…Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing…”
Získať plný text
Paper -
16
Sketching Algorithms and Lower Bounds for Ridge Regression
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 16.06.2022Vydané v arXiv.org (16.06.2022)“…We give a sketching-based iterative algorithm that computes a \(1+\varepsilon\) approximate solution for the ridge regression problem \(\min_x \|Ax-b\|_2^2…”
Získať plný text
Paper -
17
On randomized sketching algorithms and the Tracy-Widom law
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 03.01.2022Vydané v arXiv.org (03.01.2022)“… These algorithms are often referred to as sketching algorithms, as the projected dataset can be used as a compressed representation of the full dataset…”
Získať plný text
Paper -
18
Practical sketching algorithms for low-rank matrix approximation
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 02.01.2018Vydané v arXiv.org (02.01.2018)“…This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a…”
Získať plný text
Paper -
19
Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 27.01.2023Vydané v arXiv.org (27.01.2023)“…Low-rank approximation of tensors has been widely used in high-dimensional data analysis. It usually involves singular value decomposition (SVD) of large-scale…”
Získať plný text
Paper -
20
Statistical properties of sketching algorithms
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 12.06.2017Vydané v arXiv.org (12.06.2017)“… Numerical operations on big datasets can be intolerably slow; sketching algorithms address this issue by generating a smaller surrogate dataset…”
Získať plný text
Paper