We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
This paper describes an optimization framework for reconstructing nonnegative image intensities from linear projections contaminated with Poisson noise. Such Poisson inverse probl...
Rebecca Willett, Zachary T. Harmany, Roummel F. Ma...