Budgeted Object Detection via Online Submodular Approximation Algorithm
- 12 August 2026
- book chapter
- Published by Springer Nature
- p. 194-208
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Deterministic streaming algorithms for non-monotone submodular maximizationFrontiers of Computer Science, 2024
- Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexityJournal of Combinatorial Optimization, 2024
- Black-box Explanation of Object Detectors via Saliency Maps2021
- Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networks2020
- Grad-CAM++: Generalized Gradient-Based Visual Explanations for Deep Convolutional Networks2018
- Deep Residual Learning for Image Recognition2016
- Submodular Function Maximization2014
- Optimizing Sensing: From Water to the WebComputer, 2009
- A note on maximizing a submodular set function subject to a knapsack constraintOperations Research Letters, 2004
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978