Sciweavers

105 search results - page 14 / 21
» Persistence in discrete optimization under data uncertainty
Sort
View
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
14 years 11 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard
JUCS
2010
134views more  JUCS 2010»
14 years 7 months ago
Track-To-Track Measurement Fusion Architectures and Correlation Analysis
: The purpose of this paper is to address some theoretical issues related to the track-to-track fusion problem when the measurements tracking the same target are inherently correla...
Mourad Oussalah, Zahir Messaoudi, Abdelaziz Ouldal...
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
MOR
2007
149views more  MOR 2007»
14 years 9 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
ATAL
2009
Springer
15 years 4 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...