Results 31 to 40 of about 7,409 (173)
Programming and symbolic computation in Maude
Journal of Logical and Algebraic Methods in Programming, 2020 Journal of Logical and Algebraic Methods in Programming ...
Francisco Durán 0001 +6 more
openaire +4 more sources
A Novel Histogram Region Merging Based Multithreshold Segmentation Algorithm for MR Brain Images
International Journal of Biomedical Imaging, 2017 Multithreshold segmentation algorithm is time-consuming, and the time complexity will increase exponentially with the increase of thresholds. In order to reduce the time complexity, a novel multithreshold segmentation algorithm is proposed in this paper.
Siyan Liu +3 more
doaj +1 more source
Efficient Heuristics for Structure Learning of k-Dependence Bayesian Classifier
Entropy, 2018 The rapid growth in data makes the quest for highly scalable learners a popular one. To achieve the trade-off between structure complexity and classification accuracy, the k-dependence Bayesian classifier (KDB) allows to represent different number of ...
Yang Liu, Limin Wang, Minghui Sun
doaj +1 more source
The Summation Package Sigma: Underlying Principles and a Rhombus Tiling Application [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 We give an overview of how a huge class of multisum identities can be proven and discovered with the summation package Sigma implemented in the computer algebra system Mathematica. General principles of symbolic summation are discussed. We illustrate the
Carsten Schneider
doaj +1 more source
Symbolic computation with fermions
Journal of Symbolic Computation, 1990 A set of REDUCE routines for manipulating operators which anticommute amongst themselves is described. These routines have applications in theories such as supergravity where anticommuting operators are used to represent fermions. The Dirac bracket of the supersymmetry constraints arising in a quantum cosmological model based on N=1 supergravity ...
openaire +1 more source
Computability in Symbolic Dynamics [PDF]
, 2016 We give an overview of the interplay between computability and symbolic dynamics.
openaire +2 more sources
Robust Structure Learning of Bayesian Network by Identifying Significant Dependencies
IEEE Access, 2019 Bayesian networks have long been a popular medium for graphically representing the probabilistic dependencies which exist in a domain. State-of-the-art tree-augmented naive Bayes (TAN) builds maximum weighted spanning tree to represent 1-dependence ...
Yuguang Long +3 more
doaj +1 more source
Frontiers in Genetics, 2022 Studies have found that pathogenic fungi and plants have sRNA transboundary regulation mechanisms. However, no researchers have used computer methods to carry out comprehensive studies on whether there is a more remarkable similarity in the transboundary
Junxia Chi +14 more
doaj +1 more source
Fairchild Symbol Computer [PDF]
IEEE Annals of the History of Computing, 2008 Under the leadership of Gordon Moore, Fairchild Semiconductor embarked on the design of a high-level time-sharing computer, Symbol IIR. In the mid-1960s, the falling costs of semiconductors made hardware seem like the logical design choice to replace common software functions. Symbol embodied that design, but to what effect?
openaire +1 more source
Symbolic Computation of Petri Nets [PDF]
, 2007 Petri nets are receiving increasing attention from the scientific community during the last few years. They provide the users with a powerful formalism for describing and analyzing a variety of information processing systems such as finite-state machines, concurrent systems, multiprocessors and parallel computation, formal languages, communication ...
Andrés Iglesias 0001, Sinan Kapçak
openaire +2 more sources