Upper bounds of degree 3 for the probability of the union of events via linear programming.
Pierangela VenezianiPublished in: Discret. Appl. Math. (2009)
Keyphrases
- upper bound
- linear programming
- lower bound
- error probability
- probability distribution
- linear program
- np hard
- occurrence probabilities
- event detection
- upper and lower bounds
- objective function
- worst case
- lower and upper bounds
- tight bounds
- optimal solution
- upper bounding
- quadratic programming
- tight upper and lower bounds
- branch and bound algorithm
- branch and bound
- constraint propagation
- feasible solution
- dynamic programming
- temporal data
- event sequences
- probability measure
- special case
- temporal patterns
- integer programming
- temporal information
- sufficient conditions