• ANewDsc

  • Referenced in 11 articles [sw19984]
  • case complexity for the considered problem, matching the complexity of Pan’s method for computing...
  • StatMatch

  • Referenced in 23 articles [sw11933]
  • Methods to perform statistical matching when dealing with data from complex sample surveys are available...
  • GluCat

  • Referenced in 13 articles [sw04959]
  • these semantics, the GluCat interface matches float or complex<> as much as possible...
  • nbpMatching

  • Referenced in 14 articles [sw06785]
  • matrix. It brings greater flexibility to the matching design, such as multigroup comparisons. Thanks ... time and complexity is low. This article reviews the optimal nonbipartite matching algorithm ... statistical applications, including observational studies with complex designs and an exact distribution-free test comparing ... package that performs optimal nonbipartite matching. We present an easily accessible web application to make...
  • CF-GGA

  • Referenced in 18 articles [sw02592]
  • able to match solutions with several highly complex algorithms and heuristics that were previously employed...
  • Cross

  • Referenced in 7 articles [sw30282]
  • noiseless measurements, which matches the sample complexity lower bound. In the case of noisy measurements ... develop a theoretical upper bound and the matching minimax lower bound for recovery error over...
  • Dymola

  • Referenced in 54 articles [sw06285]
  • modeling and simulation of integrated and complex systems for use within automotive, aerospace, robotics, process ... ready made model libraries to better match users unique modeling and simulation needs. The flexibility...
  • AIDE

  • Referenced in 5 articles [sw28438]
  • that DANE algorithm does not match the communication complexity lower bounds. To bridge this ... first method, called AIDE, that not only matches the communication lower bounds but can also...
  • IETI

  • Referenced in 68 articles [sw19412]
  • spline) based isogeometric analysis (IGA) applied to complex geometries requires to represent the computational domain ... subdomains along interfaces (both for matching interfaces and for interfaces with T-joints, i.e. hanging...
  • IMRO

  • Referenced in 9 articles [sw20465]
  • provide a complexity analysis for variants of IMRO, showing that it matches known best bounds...
  • Key.Net

  • Referenced in 3 articles [sw31202]
  • detectors in terms of repeatability, matching performance and complexity...
  • SEMINT

  • Referenced in 15 articles [sw00845]
  • data contents to produce rules for matching corresponding attributes automatically. This paper provides theoretical background ... SEMINT. Experimental results from large and complex real databases are presented. We discuss the effectiveness...
  • BigDFT

  • Referenced in 6 articles [sw10171]
  • match with the needs of robustness and flexibility of a complex code like BigDFT. This...
  • GrGen

  • Referenced in 21 articles [sw00387]
  • graph transformation, which eases the transformation of complex graph structured data as e.g. required ... abstraction level of graphs, with declarative pattern matching and rewriting, on a visualization of your...
  • VAMMPIRE

  • Referenced in 1 article [sw19737]
  • within the cocrystallized protein-ligand complex. Virtually Aligned Matched Molecular Pairs Including Receptor Environment (VAMMPIRE...
  • myPatterns

  • Referenced in 1 article [sw12869]
  • useful they are for matching simple or complex patterns within text (that is, within strings ... MyPatterns implement a generalized form of pattern matching, for any data structures, beyond solely strings...
  • CompariMotif

  • Referenced in 2 articles [sw35356]
  • between motifs, including exact matches, variants of degenerate motifs and complex overlapping motifs. Motif relationships...
  • MYSTIQ

  • Referenced in 12 articles [sw09439]
  • violate some global integrity constraints; fuzzy matches between objects from different sources may return false ... environment, users some-times want to ask complex, structurally rich queries, using query constructs typically...
  • Equations

  • Referenced in 6 articles [sw28614]
  • compiler for definitions made by pattern matching on inductive families in the Coq system ... dependent types and complex recursion schemes...
  • Blossom V

  • Referenced in 28 articles [sw04780]
  • Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer ... queues does not improve the worst-case complexity, it appears to lead to an efficient...