Sciweavers

10072 search results - page 1910 / 2015
» Composition of Model Programs
Sort
View
123
Voted
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 2 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
131
Voted
ICALP
2009
Springer
16 years 2 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
123
Voted
ICALP
2009
Springer
16 years 2 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
132
Voted
ICALP
2009
Springer
16 years 2 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...
118
Voted
MOBIHOC
2005
ACM
16 years 2 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...
« Prev « First page 1910 / 2015 Last » Next »