In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
— We study coding and modulation rate adaptation problem for HARQ systems with partially observable state from cross-layer viewpoint. The rate of convolutionally coded MQAM is ad...