Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
Yanjun Yan, Lisa Ann Osadciw, Glen Benson, Eric Wh...
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...