• SparsePR

  • Referenced in 14 articles [sw25721]
  • Robust Sparse Phase Retrieval Made Easy, Mark Iwen, Aditya Viswanthan and Yang Wang: In this ... phase retrieval strategy that uses a near-optimal number of measurements, and is both computationally...
  • RECFMM

  • Referenced in 5 articles [sw21760]
  • CILK in particular, which provides graph-theoretic optimal scheduling in adaptation to the dynamics ... employed. RECFMM supports multiple algorithm variants that mark the major advances with low-frequency interaction...
  • TagProp

  • Referenced in 17 articles [sw11682]
  • training set. In this manner, we can optimally combine a collection of image similarity metrics ... sets. On all three, TagProp makes a marked improvement as compared to the current state...
  • FASP

  • Referenced in 2 articles [sw19089]
  • Though these efforts have yielded many mathematically optimal solvers such as the multigrid method ... been much used in practical applications. This marked gap between theory and practice is mainly ... narrow this gap, specifically by developing mathematically optimal solvers that are robust and easy...
  • BITSCAN

  • Referenced in 3 articles [sw21470]
  • result of years of research in combinatorial optimization problems and has been shown very useful ... members belonging to the set are marked as a 1-bit and referred...
  • SensSB

  • Referenced in 5 articles [sw19500]
  • analysis, (ii) pseudo-global identifiability analysis, (iii) optimal experimental design (OED) based on global sensitivities ... import models in the Systems Biology Mark-up Language (SBML) format. Several examples from simple...
  • Memorize

  • Referenced in 1 article [sw30155]
  • Enhancing human learning via spaced repetition optimization. Spaced repetition is a technique for efficient memorization ... spaced repetition using the framework of marked temporal point processes and then address the design ... repetition algorithms with provable guarantees as an optimal control problem for stochastic differential equations with...
  • NPPC

  • Referenced in 4 articles [sw08728]
  • obtained by minimizing two related regularized quadratic optimization problems performs equally with that of other ... NPPC is verified experimentally on several bench mark and synthetic data sets for both linear...
  • ASPIC

  • Referenced in 3 articles [sw17147]
  • splicing as an optimization problem, where the optimal multiple transcript alignment minimizes the number ... implements an upload facility. CONCLUSION: Extensive bench marking shows that ASPIC outperforms other existing methods...
  • GenClust

  • Referenced in 3 articles [sw30045]
  • finding good heuristic solutions to a difficult optimization problem such as clustering. Results: GenClust ... algorithms we have used is markedly superior to the others across data sets and validation...
  • R-SATCHMO

  • Referenced in 3 articles [sw06620]
  • contribute to irrelevant forward chaining reasoning are marked as `useful’. The other is that ... which I-SATCHMO does. R-SATCHMO is optimal in the sense that during reasoning...
  • ThIEF

  • Referenced in 1 article [sw33129]
  • output is an alignment of nucleosomes/histone marks across time points (that we call trajectories), allowing ... ThIEF:LP is guaranteed to find the optimal solution, but it is slower than ThIEF...
  • DeepChrome

  • Referenced in 1 article [sw15813]
  • among histone modifications, we propose a novel optimization-based technique that generates feature pattern maps ... insights about combinatorial interactions among histone modification marks, some of which have recently been observed...
  • MrTADFinder

  • Referenced in 1 article [sw34259]
  • formulate TAD identification as a network optimization problem and propose an algorithm, MrTADFinder, to identify ... datasets. The identified domain boundaries are marked by characteristic signatures in chromatin marks and transcription...
  • CoCoA

  • Referenced in 634 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Cuba

  • Referenced in 60 articles [sw00173]
  • Cuba -- a library for multidimensional numerical integration. The...
  • GAP

  • Referenced in 2948 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • HYPENS

  • Referenced in 4 articles [sw00422]
  • HYPENS is an open source tool to simulate...
  • Magma

  • Referenced in 2986 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...