10608 search results - page 1964 / 2122 » Complexity of O'Hara's Algorithm |
129
Voted
CIKM
2006
Springer
15 years 2 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...
102
Voted
COCO
2005
Springer
15 years 2 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...
112
Voted
CONEXT
2005
ACM
15 years 2 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
Voted
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
APPROX
2010
Springer
15 years 2 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 ...