• ANewDsc

  • Referenced in 6 articles [sw19984]
  • intervals for the existence of roots, Newton iteration to speed up convergence against clusters ... worst-case complexity for the considered problem, matching the complexity ... method for computing all complex roots and improving upon the complexity of other subdivision methods...
  • SA-cluster

  • Referenced in 7 articles [sw06867]
  • consequence, matrix multiplication is repeated in each iteration of the clustering process to recalculate ... edge weight update. In order to improve the efficiency and scalability of SA-cluster ... walk distances given the edge weight increments. Complexity analysis is provided to estimate how much...
  • EPnP

  • Referenced in 8 articles [sw29721]
  • Problem. We propose a non-iterative solution to the PnP problem—the estimation ... point correspondences—whose computational complexity grows linearly with n. This is in contrast to state ... initialize a Gauss-Newton scheme, which improves accuracy with negligible amount of additional time...
  • BEDFix

  • Referenced in 9 articles [sw04469]
  • numerical tests indicate that BEDFix significantly improves the average-case performance. In addition, we show ... with significantly better performance than the simple iteration method, when the Lipschitz constant is less ... Lipschitz constants equal to 1, whereas the complexity of simple iteration approaches infinity...
  • Inc-cluster

  • Referenced in 4 articles [sw06866]
  • consequence, matrix multiplication is repeated in each iteration of the clustering process to recalculate ... edge weight update. In order to improve the efficiency and scalability of SA-cluster ... walk distances given the edge weight increments. Complexity analysis is provided to estimate how much...
  • ipPCA

  • Referenced in 2 articles [sw33855]
  • highly stratified population datasets by combining iterative pruning principal component analysis and structure. Conclusions ... application of EigenDev to the ipPCA algorithm improves the estimation of the number of subpopulations ... assignment accuracy, especially for very large and complex datasets. Furthermore, we have demonstrated that...
  • ActiVis

  • Referenced in 1 article [sw27155]
  • help users interpret deep learning models, the complexity and wide variety of models deployed ... Facebook, we have developed, deployed, and iteratively improved ActiVis, an interactive visualization system for interpreting ... pattern discovery and comparison, users can explore complex deep neural network models at both...
  • Integer-Complexity

  • Referenced in 2 articles [sw29697]
  • algorithms have been developed to calculate the complexity of all integers up to (n). Currently ... recursiv definition given by Guy and iterates through products ... limiting factor is iterating through the sums. We discuss potential improvements to this algorithsm...
  • E-NAUTILUS

  • Referenced in 3 articles [sw17037]
  • NAUTILUS: A decision support system for complex multiobjective optimization problems based on the NAUTILUS method ... point. At successive iterations, (s)he always sees points which improve all the objective values...
  • ExSTraCS

  • Referenced in 1 article [sw28621]
  • complex spectrum of simulated genetic datasets demonstrated that these new mechanisms dramatically improve nearly every ... similar or fewer learning iterations than previously reported, with smaller finite training sets, and without...
  • FMGaBP

  • Referenced in 1 article [sw16762]
  • architectures is severely limited by conventional sparse iterative solvers. Conventional solvers are based ... specific CPU architectures are used to improve the poor performance of sparse algebraic kernels ... FMGaBP, which enhance its computation and communication complexities. A Helmholtz problem is used to validate...
  • TARM

  • Referenced in 1 article [sw30728]
  • problem is computationally prohibitive. Approximate low-complexity solutions for ARM have recently attracted much research ... interest. In this paper, we design an iterative algorithm for ARM based on message passing ... corresponds to a random selection matrix. Slight improvement of the matrix completion performance has been...
  • MPiTOUGH2

  • Referenced in 1 article [sw23340]
  • robust and efficient calibration of complex models. The optimization framework is based on the parameter ... simulation operators use domain decomposition and parallel iterative Krylov solver techniques. The geophysical forward simulation ... time-harmonic electromagnetic fields. We first show improved model resolution capabilities on a synthetic joint...
  • ANSYS

  • Referenced in 652 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • Apron

  • Referenced in 66 articles [sw00045]
  • Apron: a library of numerical abstract domains for...
  • BARON

  • Referenced in 308 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CoCoA

  • Referenced in 615 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • CSDP

  • Referenced in 195 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • gmp

  • Referenced in 261 articles [sw00363]
  • GMP is a free library for arbitrary precision...