• BLOOMP

  • Referenced in 28 articles [sw06454]
  • grid spacing is below the Rayleigh threshold. Algorithms based on techniques of band exclusion ... pursuit (OMP), subspace pursuit (SP), iterative hard thresholding (IHT), basis pursuit (BP), and Lasso ... comparisons with the algorithms spectral iterative hard thresholding and the frame-adapted BP demonstrate...
  • MODENAR

  • Referenced in 11 articles [sw38284]
  • support and the minimum confidence thresholds which are hard to determine for each database...
  • FinCovRegularization

  • Referenced in 2 articles [sw14857]
  • regularized estimators are included: banding, tapering, hard-thresholding and soft- thresholding. The tuning parameters...
  • SMLE

  • Referenced in 1 article [sw40997]
  • feature selection based on an iterative hard-thresholding procedure and a user-specified selection criterion...
  • CVTuningCov

  • Referenced in 1 article [sw16329]
  • regularized methods are implemented: banding, tapering, hard-thresholding and soft-thresholding. Two types of matrix...
  • azove

  • Referenced in 13 articles [sw04634]
  • parallel AND operation on threshold BDDs. In particular our algorithm is capable of solving knapsack ... optimal variable ordering is an NP-hard problem. We derive a $0/1$ IP for finding ... optimal variable ordering of a threshold BDD. This $0/1$ IP formulation provides the basis...
  • AAPL

  • Referenced in 1 article [sw35616]
  • tables generated using hard cutoffs may be sensitive to arbitrary threshold choice. We develop...
  • SE-Sync

  • Referenced in 12 articles [sw40678]
  • nonconvex maximum-likelihood estimation that is computationally hard to solve in general. Nevertheless, in this ... available measurements falls below a certain critical threshold; furthermore, whenever exactness obtains, it is possible...
  • TFRP

  • Referenced in 3 articles [sw37089]
  • where k is a pre-defined security threshold. For a certain k, an optimal multivariable ... minimum information loss is an NP-hard problem. Existing fixed-size techniques can obtain...
  • LAPACK

  • Referenced in 1713 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LSQR

  • Referenced in 410 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...
  • Maple

  • Referenced in 5403 articles [sw00545]
  • The result of over 30 years of cutting...
  • MATCONT

  • Referenced in 455 articles [sw00551]
  • MATCONT: Matlab software for bifurcation study of dynamical...
  • Mathematica

  • Referenced in 6445 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13702 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • nauty

  • Referenced in 625 articles [sw00611]
  • graph-theoretic program NAUTY: nauty is a program...
  • polymake

  • Referenced in 328 articles [sw00724]
  • polymake is open source software for research in...
  • PSPLIB

  • Referenced in 277 articles [sw00740]
  • PSPLIB -- a project scheduling problem library. We present...
  • QAPLIB

  • Referenced in 236 articles [sw00751]
  • A collection of electronically available data instances for...
  • R

  • Referenced in 10196 articles [sw00771]
  • R is a language and environment for statistical...