The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Lower bounds on the finite union probability are established in terms of the individual event probabilities and a weighted sum of the pairwise event probabilities. The lower bounds have at most pseudo-polynomial computational complexity and generalize recent analytical bounds.
We present new results on bounding the probability of a finite union of events, equation for a fixed positive integer N, using partial information on the events joint probabilities. We first consider bounds that are established in terms of {P(Ai)} and {ΣjcjP(Ai ∩ Aj)} where c1, …, cN are given weights. We derive a new class of lower bounds of at most pseudo-polynomial computational complexity. This...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.