Using atomic bounds to get sub-modular approximations

DOI10.1007/978-3-031-18843-5_5MaRDI QIDQ6163907zbMATH OpenOpenAlexFDO

Authors S. Destercke, Agnès Rico, O. Strauss

Publication date 26 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-18843-5_5

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On additive approximate submodularity
• Approximate modularity revisited
• Approximate modularity revisited
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Submodular set functions and monotone systems in aggregation problems. II

Cites work

• An efficient branch-and-cut algorithm for submodular function maximization
• B-spline signal processing. I. Theory
• Binary interactions and subset choice
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 193123 (Why is no real title available?)
• Interactive optimization of submodular functions under matroid constraints
• No empirical probability measure can converge in the total variation sense for all distributions
• Non-additive interval-valued F-transform
• On the granularity of summative kernels
• Practical representations of incomplete probabilistic knowledge
• PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
• Set functions, games and capacities in decision making
• Some axiomatic and algorithmic perspectives on the social ranking problem
• The legacy of 50 years of fuzzy sets: a discussion
• Towards the unification of band-limited derivative operators for edge detection
• When upper probabilities are possibility measures

This page was built for publication: Using atomic bounds to get sub-modular approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163907)