Search Results - "pass-efficient algorithm"

Pass Efficient Algorithm for Approximating Large Matrices

Authors: Petros Drineas Ravi Kannan The Pennsylvania State University CiteSeerX Archives

Contributors: Petros Drineas Ravi Kannan The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.yale.edu/homes/kannan/Papers/./twopasses.ps.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.4324; http://www.cs.yale.edu/homes/kannan/Papers/./twopasses.ps

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.4324
http://www.cs.yale.edu/homes/kannan/Papers/./twopasses.ps

Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation

Authors: Yu, Wenjian Gu, Yu Li, Yaohang

Source: SIAM Journal on Matrix Analysis and Applications. 39:1339-1359

Subject Terms: FOS: Computer and information sciences, Randomized algorithm, Computer Sciences, Theory and Algorithms, Pass-efficient algorithm, Low-rank matrix approximation, Numerical Analysis (math.NA), 01 natural sciences, Fixed-precision problem, 15A18, 65F30, 65F15, 68W20, 60B20, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Adaptive rank determination, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Distributed, Parallel, and Cluster Computing (cs.DC), 0101 mathematics

File Description: application/pdf

Access URL: http://arxiv.org/pdf/1606.09402
http://arxiv.org/abs/1606.09402
http://doi.org/10.1137/17M1141977
https://dblp.uni-trier.de/db/journals/siammax/siammax39.html#YuGL18
https://doi.org/10.1137/17M1141977
https://epubs.siam.org/doi/pdf/10.1137/17M1141977
https://digitalcommons.odu.edu/mathstat_fac_pubs/190/

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

Authors: Halko, N. Martinsson, P. G. Tropp, J. A.

Source: SIAM Review. 53:217-288

Subject Terms: Johnsonâ€' Lindenstrauss lemma, dimension reduction, principal component analysis, interpolative decomposition, Probability (math.PR), singular value decomposition, random matrix, Numerical Analysis (math.NA), eigenvalue decomposition, rank-revealing QR factorization, 01 natural sciences, matrix approximation, randomized algorithm, pass-efficient algorithm, parallel algorithm, streaming algorithm, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, Mathematics - Probability

Access URL: https://authors.library.caltech.edu/27399/1/Halko2011p16112SIAM_Review.pdf
http://arxiv.org/abs/0909.4061

Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions

Authors: N. Halko P. G. Martinsson The Pennsylvania State University CiteSeerX Archives

Contributors: N. Halko P. G. Martinsson The Pennsylvania State University CiteSeerX Archives

Source: http://users.cms.caltech.edu/~jtropp/papers/HMT11-Finding-Structure-SIREV.pdf.

Subject Terms: Key words. dimension reduction, eigenvalue decomposition, interpolative decomposition, Johnson– Lindenstrauss lemma, matrix approximation, parallel algorithm, pass-efficient algorithm, principal component analysis, randomized algorithm, random matrix, rank-rev

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.2800

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.2800
http://users.cms.caltech.edu/~jtropp/papers/HMT11-Finding-Structure-SIREV.pdf

EFFICIENT RANDOMIZED ALGORITHMS FOR THE FIXED-PRECISION LOW-RANK MATRIX APPROXIMATION.

Authors: WENJIAN YU YU GU YAOHANG LI

Source: SIAM Journal on Matrix Analysis & Applications; 2018, Vol. 39 Issue 3, p1339-1359, 21p

Subject Terms: FIXED point theory, APPROXIMATION algorithms, MATRICES (Mathematics), ERROR analysis in mathematics, CONJUGATE gradient methods

CPQR-based randomized algorithms for generalized CUR decompositions.

Authors: Guihua Zhang Hanyu Li Yimin Wei

Source: Computational & Applied Mathematics; Apr2024, Vol. 43 Issue 3, p1-28, 28p

Subject Terms: MATRIX decomposition, ALGORITHMS

Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation

Authors: Yu, Wenjian Gu, Yu Li, Yaohang

Index Terms: Mathematics - Numerical Analysis, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 15A18, 65F30, 65F15, 68W20, 60B20, text

URL: http://arxiv.org/abs/1606.09402

A Randomized Algorithm for Tensor Singular Value Decomposition Using an Arbitrary Number of Passes.

Authors: Ahmadi-Asl, Salman Phan, Anh-Huy Cichocki, Andrzej

Source: Journal of Scientific Computing; Jan2024, Vol. 98 Issue 1, p1-25, 25p

Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds.

Authors: Witten, Rafi Candès, Emmanuel

Source: Algorithmica. May2015, Vol. 72 Issue 1, p264-281. 18p.

Subject Terms: *DIMENSION reduction (Statistics), *LOW-rank matrices, *RANDOM variables, *ALGORITHMIC randomness, *RANDOM graphs, *DIMENSIONAL reduction algorithms

Managing waiting times of backordered demands in single-stage (Q, r) inventory systems

Authors: Boyaci, Tamer Gallego, Guillermo

Index Terms: Article

URL: http://repository.ust.hk/ir/Record/1783.1-75080
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0894069X&rft.volume=49&rft.issue=6&rft.date=2002&rft.spage=557&rft.aulast=Boyaci&rft.aufirst=Tamer&rft.atitle=Managing%20waiting%20times%20of%20backordered%20demands%20in%20single-stage%20(Q%2C%20r)%20inventory%20systems&rft.title=Naval%20Research%20Logistics
http://www.scopus.com/record/display.url?eid=2-s2.0-0036729345&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000177647700002

Reducing the amount of out‐of‐core data access for GPU‐accelerated randomized SVD.

Authors: Lu, Yuechao Yamazaki, Ichitaro Ino, Fumihiko et al.

Source: Concurrency & Computation: Practice & Experience; 10/10/2020, Vol. 32 Issue 19, p1-20, 20p

Subject Terms: SINGULAR value decomposition, GRAPHICS processing units, PRINCIPAL components analysis

YYC: A Fast Performance Incremental Algorithm for Finding Typical Testors.

Authors: Alba-Cabrera, Eduardo Ibarra-Fiallo, Julio Godoy-Calderon, Salvador et al.

Source: Progress in Pattern Recognition, Image Analysis, Computer Vision & Applications: 19th Iberoamerican Congress, CIARP 2014, Puerto Vallarta, Mexico, November 2-5, 2014. Proceedings; 2014, p416-423, 8p

Improved Approximation Algorithms for Large Matrices via Random Projections.

Authors: Tamas Sarlos

Source: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06); 2006, p143-152, 10p

Adaptive Sampling and Fast Low-Rank Matrix Approximation.

Authors: Díaz, Josep Jansen, Klaus Rolim, José D. P. et al.

Source: Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783540380443); 2006, p292-303, 12p

Partitions and Piecewise Models.

Authors: Shewhart, Walter A. Wilks, Samuel S. Dasu, Tamraparni et al.

Source: Exploratory Data Mining & Data Cleaning; 2003, p69-98, 30p

Matrix approximation and projective clustering via volume sampling

Authors: Luis Rademacher Santosh Vempala Amit Deshpande et al.

Source: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06. :1117-1126

Access URL: http://toc.nada.kth.se/articles/v002a012/v002a012.pdf
http://web.cse.ohio-state.edu/~lrademac/soda_presentation.pdf
http://toc.ilab.sztaki.hu/articles/v002a012/v002a012.pdf
http://mirror.cse.iitk.ac.in/toc/articles/v002a012/v002a012.pdf
https://dblp.uni-trier.de/db/conf/soda/soda2006.html#DeshpandeRVW06
http://core.ac.uk/display/20699838

Matrix approximation and projective clustering via iterative sampling

Authors: Amit Deshpande Luis Rademacher Santosh Vempala et al.

Contributors: Amit Deshpande Luis Rademacher Santosh Vempala et al.

Source: http://toc.nada.kth.se/articles/v002a012/v002a012.pdf.

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.2728; http://toc.nada.kth.se/articles/v002a012/v002a012.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.2728
http://toc.nada.kth.se/articles/v002a012/v002a012.pdf

Pass-Efficient Algorithms for Clustering

Authors: Kevin Li-chiang Chang The Pennsylvania State University CiteSeerX Archives

Contributors: Kevin Li-chiang Chang The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.yale.edu/~klc39/thesis.ps.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.7707; http://www.cs.yale.edu/~klc39/thesis.ps

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.7707
http://www.cs.yale.edu/~klc39/thesis.ps

Matrix Approximation and Projective Clustering via Volume Sampling

Authors: Amit Deshpande Luis Rademacher Santosh Vempala et al.

Contributors: Amit Deshpande Luis Rademacher Santosh Vempala et al.

Source: http://theoryofcomputing.org/articles/main/v002/a012/a012.pdf.

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.6655; http://theoryofcomputing.org/articles/main/v002/a012/a012.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.6655
http://theoryofcomputing.org/articles/main/v002/a012/a012.pdf

Managing waiting times of backordered demands in single‐stage (Q, r) inventory systems: Managing waiting times of backordered demands in single-stage \((Q,r)\) inventory systems

Authors: Boyaci, Tamer Gallego, Guillermo

Source: Naval Research Logistics (NRL). 49:557-573

Subject Terms: 0211 other engineering and technologies, 1. No poverty, Inventory, storage, reservoirs, 02 engineering and technology, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1847039
https://doi.org/10.1002/nav.10028
https://onlinelibrary.wiley.com/doi/10.1002/nav.10028
https://repository.ust.hk/ir/Record/1783.1-75080