Computational aspects of the Mobius transformation of graphs
From MaRDI portal
(Redirected from Publication:4014208)
Recommendations
Cited in
(25)- The application of the matrix calculus to belief functions.
- Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
- Incremental conditioning of lower and upper probabilities
- Covering and packing in linear space
- A generic convolution algorithm for join operations on tree decompositions
- Focal points and their implications for Möbius transforms and Dempster-Shafer theory
- Clustering decomposed belief functions using generalized weights of conflict
- Estimating limits from Poisson counting data using Dempster-Shafer analysis
- On the computation of the Möbius transform
- Cancellation-free circuits in unbounded and bounded depth
- Dealing with external actions in belief causal networks
- Fast monotone summation over disjoint sets
- Fast Möbius inversion in semimodular lattices and ER-labelable posets
- Efficient Möbius transformations and their applications to D-S theory
- scientific article; zbMATH DE number 19879 (Why is no real title available?)
- Evaluation of permanents in rings and semirings
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects
- Constructing and evaluating alternative frames of discernment
- Faster algorithms for finding and counting subgraphs
- Fast Algorithms for Join Operations on Tree Decompositions
- Fast zeta transforms for lattices with few irreducibles
- An Extension of Specificity-Based Approximations to Other Belief Function Relations
- Representations of uncertainty in AI: beyond probability and possibility
- An Inference Method for Global Sensitivity Analysis
- Breaking the 2ⁿ barrier for 5-coloring and 6-coloring
This page was built for publication: Computational aspects of the Mobius transformation of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014208)
