Using atomic bounds to get sub-modular approximations

DOI10.1007/978-3-031-18843-5_5zbMath1524.68372OpenAlexW4312978199MaRDI QIDQ6163907

Olivier Strauss, Agnès Rico, Sebastien Destercke

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)

Cites Work

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

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