65 search results - page 5 / 13 » Uniform Derandomization from Pathetic Lower Bounds |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
ADHOC
2008
13 years 7 months ago
2008
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
RTAS
2005
IEEE
14 years 28 days ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...