Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
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...
Wireless Sensor and Actor Networks (WSANs) are composed of a large number of heterogeneous nodes called sensors and actors. The collaborative operation of sensors enables the dist...
Tommaso Melodia, Dario Pompili, Vehbi C. Gungor, I...
We address the character identification problem in
movies and television videos: assigning names to faces on
the screen. Most prior work on person recognition in video
assumes s...
Timothee Cour, Benjamin Sapp, Akash Nagle, Ben Tas...