15033 search results - page 2868 / 3007 » Complexity Theory and Algorithms |
159
click to vote
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
126
click to vote
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
145
click to vote
CONEXT
2005
ACM
15 years 6 months ago
2005
ACM
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
128
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
137
click to vote
CLIMA
2007
15 years 5 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...