Výsledky vyhľadávania - "Randomized algorithm"

A randomized algorithm for clustering discrete sequences Autor Jiang, Mudi, Hu, Lianyu, Han, Xin, Zhou, Yong, He, Zengyou

“…Cluster analysis is one of the most important research issues in data mining and machine learning. To date, numerous clustering algorithms have been proposed…”
Získať plný text

A nearly optimal randomized algorithm for explorable heap selection: A nearly optimal randomized algorithm Autor Borst, Sander, Dadush, Daniel, Huiberts, Sophie, Kashaev, Danish

“…), who gave deterministic and randomized n · exp ( O ( log n ) ) time algorithms using O ( log ( n ) 2.5 ) and O ( log n ) space respectively. We present a new randomized algorithm with running time O…”
Získať plný text

Communication-Efficient Randomized Algorithm for Multi-Kernel Online Federated Learning Autor Hong, Songnam, Chae, Jeongmin

“…Online federated learning (OFL) is a promising framework to learn a sequence of global functions from distributed sequential data at local devices. In this…”
Získať plný text

Randomized Algorithm for Constrained Quaternion Singular Value Decomposition and Its Applications: Randomized Algorithm for Autor Chen, Jiang-Feng, Wang, Qing-Wen

“…This paper presents a novel randomized Quaternion Singular Value Decomposition (QSVD) algorithm with orthogonal constraints, specifically tailored for…”
Získať plný text

A Randomized Algorithm for Principal Component Analysis Autor Rokhlin, Vladimir, Szlam, Arthur, Tygert, Mark

“…Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of…”
Získať plný text

A fast randomized algorithm for overdetermined linear least-squares regression Autor Rokhlin, Vladimir, Tygert, Mark

“…We introduce a randomized algorithm for overdetermined linear least-squares regression…”
Zistit podrobnosti o prístupe

A simple, randomized algorithm for diagonalizing normal matrices: A simple, randomized algorithm Autor He, Haoze, Kressner, Daniel

“…We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random…”
Získať plný text

An Efficient Randomized Algorithm for Computing the Approximate Tucker Decomposition Autor Che, Maolin, Wei, Yimin, Yan, Hong

“…), we obtain an efficient randomized algorithm for computing the approximate Tucker decomposition with a given target multilinear rank…”
Získať plný text

A randomized algorithm for the decomposition of matrices Autor Martinsson, Per-Gunnar, Rokhlin, Vladimir, Tygert, Mark

“…Given an m × n matrix A and a positive integer k, we describe a randomized procedure for the approximation of A with a matrix Z of rank k. The procedure relies…”
Získať plný text

A nearly optimal randomized algorithm for explorable heap selection Autor Borst, Sander, Dadush, Daniel, Huiberts, Sophie, Kashaev, Danish

“… $$O(\log (n)^{2.5})$$ O ( log ( n ) 2.5 ) and $$O(\sqrt{\log n})$$ O ( log n ) space respectively. We present a new randomized algorithm with running time…”
Získať plný text

A Randomized Algorithm for Parsimonious Model Identification Autor Yilmaz, Burak, Bekiroglu, Korkut, Lagoa, Constantino, Sznaier, Mario

“… The randomized algorithms proposed are based on the concept of atomic norm and provide a numerically efficient way to identify sparse models from large amounts of noisy data…”
Získať plný text

A randomized-algorithm-based decomposition-ensemble learning methodology for energy price forecasting Autor Tang, Ling, Wu, Yao, Yu, Lean

“… randomized algorithms as individual forecasting tools. In the proposed methodology, Three major steps, (1…”
Získať plný text

Online Dominant Generalized Eigenvectors Extraction via a Randomized Algorithm Autor Cai, Haoyuan, Kaloorazi, Maboud, Chen, Jie, Chen, Wei, Richard, Cedric

“…This paper is concerned with online algorithms for the generalized Hermitian eigenvalue problem (GHEP). We first present an algorithm based on randomization,…”
Získať plný text

Expected polynomial-time randomized algorithm for graph coloring problem Autor Ghosal, Subhankar, Ghosh, Sasthi C.

“…Given a graph G=(V,E) with n=|V| vertices, the graph coloring problem is defined as Find a color vectorC=(c(v)), where c(v)∈{1,2,…,n} denotes the color of…”
Získať plný text

A fast randomized algorithm for the approximation of matrices Autor Woolfe, Franco, Liberty, Edo, Rokhlin, Vladimir, Tygert, Mark

“…We introduce a randomized procedure that, given an m × n matrix A and a positive integer k, approximates A with a matrix Z of rank k. The algorithm relies on…”
Získať plný text

GRVMP: A Greedy Randomized Algorithm for Virtual Machine Placement in Cloud Data Centers Autor Azizi, Sadoon, Shojafar, Mohammad, Abawajy, Jemal, Buyya, Rajkumar

“…Cloud computing efficiency greatly depends on the efficiency of the virtual machines (VMs) placement strategy used. However, VM placement has remained one of…”
Získať plný text

A subspace-orbit randomized algorithm for quaternion tensor singular value decomposition based on Qt-product Autor Liu, Yonghe, Wu, Fengsheng, Miao, Jifei, Li, Chaoqian

“…•We investigate the third-order quaternion tensor singular value decomposition.•We propose a subspace-orbit randomized algorithm based on block Krylov iteration…”
Získať plný text

Algorithm 971: An Implementation of a Randomized Algorithm for Principal Component Analysis Autor Li, Huamin, Linderman, George C, Szlam, Arthur, Stanton, Kelly P, Kluger, Yuval, Tygert, Mark

“… As illustrated via several tests, the randomized algorithms for low-rank approximation outperform or at least match the classical deterministic techniques…”
Zistit podrobnosti o prístupe

A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix Autor Boutsidis, Christos, Drineas, Petros, Kambadur, Prabhanjan, Kontopoulou, Eugenia-Maria, Zouzias, Anastasios

“…We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized…”
Získať plný text

A randomized algorithm for online metric b-matching Autor Kalyanasundaram, Bala, Pruhs, Kirk, Stein, Cliff

“…We give a randomized algorithm for online metric b-matching that is O(log2⁡k) competitive, where k is the number of server locations, by giving a black box…”
Získať plný text