Sciweavers

14244 search results - page 2753 / 2849
» Modeling Program Predictability
Sort
View
ICALP
2009
Springer
14 years 10 months ago
Dynamic Succinct Ordered Trees
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...
Arash Farzan, J. Ian Munro
ICALP
2009
Springer
14 years 10 months ago
Learning Halfspaces with Malicious Noise
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
ICALP
2009
Springer
14 years 10 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
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...
MOBIHOC
2005
ACM
14 years 9 months ago
A distributed coordination framework for wireless sensor and actor networks
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...
CVPR
2010
IEEE
14 years 6 months ago
Naming People from Dialog: Temporal Grouping and Weak Supervision
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...
« Prev « First page 2753 / 2849 Last » Next »