• HypE

  • Referenced in 85 articles [sw19794]
  • HypE: an algorithm for fast hypervolume-based many-objective optimization. In the field of evolutionary ... Pareto dominance: whenever a Pareto set approximation entirely dominates another one, then the indicator value ... indicator’s potential; current hypervolume-based search algorithms are limited to problems with only ... proposes a fast search algorithm that uses Monte Carlo simulation to approximate the exact hypervolume...
  • PSAPSR

  • Referenced in 29 articles [sw28496]
  • Fast Algorithms for Approximating the Pseudospectral Abscissa and Pseudospectral Radius. A MATLAB package for approximating...
  • CHEBINT

  • Referenced in 15 articles [sw06927]
  • features highly efficient, fast FFT-based, algorithms to determine the approximation (see [2]) that...
  • CirCut

  • Referenced in 42 articles [sw04782]
  • cost associated with such an approximation can be excessively high for large-scale problems ... codes that implement the Goemans--Williamson randomized algorithm, as well as with a purely heuristic ... approach is fast and scalable and, more importantly, attains a higher approximation quality in practice ... than that of the Goemans--Williamson randomized algorithm. An extension to MAX-BISECTION is also...
  • FLANN

  • Referenced in 33 articles [sw15312]
  • fast approximate nearest neighbor searches in high dimensional spaces. It contains a collection of algorithms...
  • TANE

  • Referenced in 39 articles [sw02196]
  • efficient algorithm for discovering functional and approximate dependencies. environments. The discovery of functional dependencies from ... analysis technique. We present TANE, an efficient algorithm for finding functional dependencies from large databases ... makes testing the validity of functional dependencies fast even for a large number of tuples ... partitions also makes the discovery of approximate functional dependencies easy and efficient and the erroneous...
  • FRSDE

  • Referenced in 15 articles [sw08762]
  • density estimator using minimal enclosing ball approximation. Reduced Set Density Estimator (RSDE) is an important ... overcome this shortcoming, a Fast Reduced Set Density Estimator algorithm (FRSDE) is proposed in this ... With this finding, the fast core-set based MEB approximation algorithm is introduced to develop...
  • Algorithm 39

  • Referenced in 42 articles [sw20048]
  • combinatorial problem of clusterwise discrete linear approximation is defined as finding a given number ... numerical example are given. Algorithm 48: a fast algorithm for clusterwise linear regression...
  • L0Learn

  • Referenced in 19 articles [sw36841]
  • package L0Learn: Fast Algorithms for Best Subset Selection. Highly optimized toolkit for approximately solving...
  • Graphs

  • Referenced in 107 articles [sw12277]
  • networks. We consider the point-to-point (approximate) shortest-path query problem, which ... network (graph). A so-called preprocessing algorithm may compute certain information (a data structure ... distance queries, which should be answered as fast as possible. Due to its many applications...
  • TreeCANN

  • Referenced in 2 articles [sw27578]
  • Neighbor Algorithm. TreeCANN is a fast algorithm for approximately matching all patches between two images ... these components substantially leading to an algorithm that is ×3 to ×5 faster than existing ... make k-d trees run as fast as recently proposed state-of-the-art methods...
  • elmap

  • Referenced in 5 articles [sw07557]
  • distribution. We propose an algorithm for fast construction of grid approximations of principal manifolds with ... vertices position refinement. This makes the algorithm very effective, especially for parallel implementations. Another advantage...
  • sugsvarsel

  • Referenced in 2 articles [sw35024]
  • SUGS and SUGS VarSel algorithms. Paper: Fast approximate inference for variable selection in Dirichlet process...
  • TensorFuzz

  • Referenced in 3 articles [sw41846]
  • specified constraints. We describe how fast approximate nearest neighbor algorithms can provide this coverage metric...
  • SABRE

  • Referenced in 7 articles [sw12884]
  • networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient...
  • COBRA

  • Referenced in 26 articles [sw02211]
  • dimensional magnetic equilibria. A new, fast, and accurate numerical algorithm to assess stability against ideal ... configuration. An initial approximation for the eigenvalue is obtained from a fast second order matrix...
  • LowRankApprox.jl

  • Referenced in 2 articles [sw33932]
  • Julia. This Julia package provides fast low-rank approximation algorithms for BLAS/LAPACK-compatible matrices based...
  • PNFFT

  • Referenced in 9 articles [sw07583]
  • parallel distributed memory algorithm for the fast computation of fully Coulomb interactions in a charged ... approximation scheme. We show that an appropriate adjustment of the underlying parallel nonequispaced fast Fourier ... prove the high scalability of our algorithms we provide performance results on a BlueGene/P system...
  • Fastcap

  • Referenced in 29 articles [sw08926]
  • capacitance extraction program. A fast algorithm for computing the capacitance of a complicated three-dimensional ... capacitance extractor FastCap is examined. The algorithm is an acceleration of the boundary-element technique ... generalized conjugate residual iterative algorithm with a multipole approximation to compute the iterates. This combination...
  • iSAX

  • Referenced in 9 articles [sw37681]
  • many interesting algorithms and representations. However, the algorithms and the size of data considered have ... approach allows both fast exact search and ultra fast approximate search. We show ... search as sub-routines in data mining algorithms, allowing for the exact mining of truly...