• Wirtinger Flow

  • Referenced in 110 articles [sw34175]
  • phase from magnitude measurements; specifically, we wish to reconstruct a complex-valued signal ... novel update rules, which have low computational complexity, much like in a gradient descent scheme ... from a nearly minimal number of random measurements. Indeed, the sequence of successive iterates provably...
  • PhaseLift

  • Referenced in 219 articles [sw31783]
  • measurements, typically from the modulus of the diffracted wave. We demonstrate empirically that a complex...
  • DeepXDE

  • Referenced in 66 articles [sw32456]
  • inverse problems given some extra measurements. DeepXDE supports complex-geometry domains based on the technique...
  • Quicksort

  • Referenced in 185 articles [sw20694]
  • algorithms are adaptive, i.e., they have a complexity analysis that is better for inputs, which ... nearly sorted, according to some specified measure of presortedness. Quicksort is not among these...
  • MIXED

  • Referenced in 76 articles [sw06480]
  • measures) data. One major advantage of this methodology is that it accommodates the complexities ... model methodology for the analysis of repeated measurements is becoming increasingly common...
  • M-MACBETH

  • Referenced in 104 articles [sw16199]
  • complex problems involving qualitative value scores and weights; Interactive sensitivity and robustness analyses. MACBETH (Measuring...
  • GADMM

  • Referenced in 29 articles [sw12640]
  • case O(1/k) convergence rate measured by the iteration complexity k represents the iteration counter...
  • PhaseMax

  • Referenced in 28 articles [sw24954]
  • real- or complex-valued) signal from magnitude-only measurements, known as phase retrieval. We formulate...
  • JIDT

  • Referenced in 9 articles [sw23550]
  • Toolkit for studying information-theoretic measures of computation in complex systems. JIDT provides a stand ... Clojure) of information-theoretic measures of distributed computation in complex systems: i.e. information storage, transfer...
  • ROCK

  • Referenced in 73 articles [sw37720]
  • methods naturally extend to non-metric similarity measures that are relevant in situations where ... knowledge. In addition to presenting detailed complexity results for ROCK, we also conduct an experimental...
  • ECoL

  • Referenced in 4 articles [sw41570]
  • package ECoL: Complexity Measures for Supervised Problems. Provides measures to characterize the complexity of classification ... implementations of many state of the art measures. The measures are described in the papers...
  • OACC

  • Referenced in 7 articles [sw10996]
  • Online Algorithmic Complexity Calculator. The Online Algorithmic Complexity Calculator (OACC) is an on-going long ... online tool implementing semi-computable measures of complexity through various numerical methods and algorithms ... algorithmic Coding theorem relating frequency and complexity), for string length which lossless compression algorithms fail ... Block Decomposition Method. More algorithmic information measures, more data and more techniques will be incorporated...
  • acss

  • Referenced in 7 articles [sw10997]
  • method (see ?acss). The database containing the complexity is provided in the data only package ... addition, two traditional (but problematic) measures of complexity are also provided: entropy and change complexity...
  • MixSim

  • Referenced in 37 articles [sw07914]
  • misclassification probabilities, measures the degree of interaction between components and can be readily employed ... control the clustering complexity of datasets simulated from mixtures. These datasets can then be used ... simulating outliers and noise variables, calculating various measures of agreement between two partitionings, and constructing...
  • QuACN

  • Referenced in 8 articles [sw07971]
  • topological network measures to analyze complex Networks structurally...
  • SimOpt

  • Referenced in 7 articles [sw23649]
  • very general technique for estimating statistical measures of complex systems. A system is modeled...
  • Krohn-Rhodes

  • Referenced in 4 articles [sw08794]
  • widely applicable integer-valued complexity measure, have been described. As a remedy for the situation...
  • PSAMS

  • Referenced in 2 articles [sw02309]
  • models, which we have developed for measuring the complexity and maintainability of a communication protocol ... system called PSAMS (protocol specification assessment and measurement system) for automatically calculating the metrics ... protocol Estelle specification: exploring its specification, measuring its complexity, assessing its maintainability, estimating its specification ... PSAMS, we have applied it to measure the complexity and maintainability of 10 communication protocol...
  • Cross

  • Referenced in 7 articles [sw30282]
  • noiseless measurements, which matches the sample complexity lower bound. In the case of noisy measurements...