Sciweavers

26 search results - page 4 / 6
» MIP reformulations of the probabilistic set covering problem
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
SRDS
2010
IEEE
13 years 5 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
ICCV
2011
IEEE
12 years 1 months ago
Video Parsing for Abnormality Detection
Detecting abnormalities in video is a challenging problem since the class of all irregular objects and behaviors is infinite and thus no (or by far not enough) abnormal training sa...
Borislav Antic, Bjorn Ommer
DKE
2008
85views more  DKE 2008»
13 years 7 months ago
On automatic knowledge validation for Bayesian knowledge bases
Knowledge validation, as part of knowledge base verification and validation is a critical process in knowledge engineering. The ultimate goal of this process is to make the knowle...
Eugene Santos Jr., Hang T. Dinh
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 28 days ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...