• ThiNet

  • Referenced in 3 articles [sw34568]
  • ThiNet: A Filter Level Pruning Method for Deep Neural Network Compression. We propose an efficient ... both training and inference stages. We focus on the filter level pruning, i.e., the whole...
  • Pueblo

  • Referenced in 29 articles [sw00743]
  • adopt the cutting-plane technique to draw inferences among PB constraints and combine it with ... Overall, our method benefits significantly from the pruning power of the learned PB constraints, while...
  • SDLNewick

  • Referenced in 1 article [sw30275]
  • Efficiently inferring pairwise subtree prune-and-regraft adjacencies between phylogenetic trees. We develop a time...
  • AFContainer

  • Referenced in 1 article [sw30276]
  • Efficiently inferring pairwise subtree prune-and-regraft adjacencies between phylogenetic trees. We develop a time...
  • BiDAG

  • Referenced in 2 articles [sw31037]
  • efficient inference on larger DAGs, the space of DAGs is pruned according to the data...
  • MGTP

  • Referenced in 7 articles [sw09701]
  • fold speedup on a parallel inference machine PIM with 256 processing elements. With MGTP ... problems in finite algebra. To enhance the pruning ability of MGTP, several new features...
  • PANFIS

  • Referenced in 8 articles [sw13735]
  • system. In practice, the rule growing and pruning are carried out merely benefiting from ... algorithm, namely parsimonious network based on fuzzy inference system (PANFIS), is to this end presented...
  • Smallify

  • Referenced in 1 article [sw36245]
  • techniques optimize model size, model accuracy and inference time in different stages, resulting in suboptimal ... size and model performance by neuron-level pruning during training. Neuron-level pruning not only ... weight matrices that are amenable to efficient inference. By applying our technique to convolutional...
  • FastMe

  • Referenced in 3 articles [sw28027]
  • inference program. FastME provides distance algorithms to infer phylogenies. FastME is based on balanced minimum ... version also includes Subtree Pruning and Regrafting, while remaining as fast as NJ and providing...
  • SMArTIC

  • Referenced in 3 articles [sw15737]
  • technique to address this concern by inferring specifications automatically. In this paper, we propose ... hypotheses: (1) Erroneous traces should be pruned from the input traces to a miner...
  • treeOclock

  • Referenced in 1 article [sw38936]
  • classical nearest neighbour interchange, subtree prune and regraft, and tree bisection and reconnection moves ... each of these graphs, making tree inference and comparison algorithms challenging to design in practice...
  • LUTNet

  • Referenced in 1 article [sw36421]
  • network accelerators using the native LUTs as inference operators. We describe the realization of both ... flexibility allows for far heavier pruning than possible in prior works, resulting in significant area...
  • LAPACK

  • Referenced in 1654 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Matlab

  • Referenced in 12661 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • mclust

  • Referenced in 272 articles [sw00563]
  • R package mclust: Normal Mixture Modeling for Model...
  • SETHEO

  • Referenced in 120 articles [sw00707]
  • SETHEO: A high-performance theorem prover. The paper...
  • R

  • Referenced in 8873 articles [sw00771]
  • R is a language and environment for statistical...
  • SOLAR

  • Referenced in 19 articles [sw00888]
  • SOLAR (SOL for Advanced Reasoning) is a first...
  • TSPLIB

  • Referenced in 676 articles [sw00983]
  • TSPLIB is a library of sample instances for...
  • SCIP

  • Referenced in 486 articles [sw01091]
  • SCIP is currently one of the fastest non...