• SA-cluster

  • Referenced in 9 articles [sw06867]
  • measure. SA-Cluster performs matrix multiplication to calculate the random walk distances between graph vertices ... matrix multiplication is repeated in each iteration of the clustering process to recalculate the random ... algorithm Inc-Cluster to incrementally update the random walk distances given the edge weight increments ... Cluster can save. We further design parallel matrix computation techniques on a multicore architecture. Experimental...
  • RandNLA

  • Referenced in 22 articles [sw41749]
  • RandNLA: Randomized Numerical Linear Algebra. Matrices are ubiquitous in computer science, statistics, and applied mathematics ... matrix can encode information about m objects (each described by n features), or the behavior...
  • MIXREG

  • Referenced in 5 articles [sw24547]
  • scoring solution, the covariance matrix of the random effects is expressed in its Gaussian decomposition ... diagonal matrix reparameterized using the exponential transformation. Estimation of the individual random effects is accomplished...
  • ASKIT

  • Referenced in 11 articles [sw17470]
  • evaluating kernel matrix-vector products. ASKIT is based on a novel, randomized method for efficiently...
  • Jellyfish

  • Referenced in 29 articles [sw12431]
  • examples of problems solvable by Jellyfish include matrix completion problems and least-squares problems regularized ... projected incremental gradient method with a biased, random ordering of the increments. This biased ordering ... number of processors. On large-scale matrix completion tasks, Jellyfish is orders of magnitude more...
  • TMB

  • Referenced in 25 articles [sw16279]
  • should be able to quickly implement complex random effect models through simple C++ templates ... combines CppAD (C++ automatic differentiation), Eigen (templated matrix-vector library) and CHOLMOD (sparse matrix routines...
  • MIXNO

  • Referenced in 9 articles [sw10546]
  • Cholesky factor of the random-effects variance-covariance matrix is estimated along with the (fixed...
  • ASPIRE

  • Referenced in 2 articles [sw32496]
  • tomography, optimization (convex and non-convex), random matrix theory, signal and image processing, linear...
  • BeamECOC

  • Referenced in 2 articles [sw38478]
  • applied to any ECOC matrix. We evaluate the accuracy of the proposed algorithm (BeamECOC) using ... validation experiments on 6 UCI datasets, using random code matrices of different sizes, and base ... number of columns of a random matrix down to 13% and still obtain comparable...
  • TRLan

  • Referenced in 68 articles [sw04029]
  • choose to implement or use a matrix-vector multiplication routine in any form convenient. Most ... such as dynamic memory management, timing functions, random number generator and so on, the program...
  • LowRankApprox.jl

  • Referenced in 2 articles [sw33932]
  • LowRankApprox.jl: fast low-rank matrix approximation in Julia. This Julia package provides fast low-rank ... latest technology in adaptive randomized matrix sketching...
  • Inc-cluster

  • Referenced in 5 articles [sw06866]
  • measure. SA-Cluster performs matrix multiplication to calculate the random walk distances between graph vertices ... matrix multiplication is repeated in each iteration of the clustering process to recalculate the random ... algorithm Inc-Cluster to incrementally update the random walk distances given the edge weight increments ... Cluster can save. We further design parallel matrix computation techniques on a multicore architecture. Experimental...
  • LSRN

  • Referenced in 27 articles [sw09555]
  • solver named LSRN that is based on random normal projection. LSRN computes the min-length ... included. Since A is involved only in matrix-matrix and matrix-vector multiplications ... dense or sparse matrix or a linear operator, and LSRN automatically speeds up when ... operator. The preconditioning phase consists of a random normal projection, which is embarrassingly parallel...
  • GAGA

  • Referenced in 2 articles [sw12223]
  • equipped with three clases of matrix multiplication, generic dense matrices, sparse matrices, and the subsampled ... there are a total of five randomly generated matrix ensembles and three randomly generated sparse ... algorithms are equipped to employ any dense matrix and any sparse matrix in COO format ... large scale testing, the GPU based random problem generation can offer up to 1600x acceleration...
  • tmvtnorm

  • Referenced in 24 articles [sw08073]
  • Truncated Multivariate Normal and Student t Distribution. Random number generation for the truncated multivariate normal ... second moments (i.e. mean and covariance matrix) for the double-truncated multinormal case...
  • FRAPP

  • Referenced in 3 articles [sw08861]
  • process, a variety of techniques based on random perturbation of individual data records have been ... present FRAPP, a generalized matrix-theoretic framework of random perturbation, which facilitates a systematic approach ... only in their choices for the perturbation matrix elements, and (b) a symmetric positive-definite ... perturbation mechanism wherein the matrix elements are themselves characterized as random variables, and demonstrate that...
  • Eigentaste

  • Referenced in 66 articles [sw12451]
  • resulting dense subset of the ratings matrix. PCA facilitates dimensionality reduction for offline clustering ... analytic estimates of NMAE when predictions are random. On the Jester dataset, Eigentaste computes recommendations...
  • RSVDPACK

  • Referenced in 6 articles [sw13832]
  • article ”Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions,” N. Halko...
  • APMC

  • Referenced in 29 articles [sw11483]
  • systems. However, the representation of the transition matrix may be expensive for very large systems ... discrete Markov chains. We give a randomized algorithm to approximate the probability that a property...