10148 search results - page 1731 / 2030 » Optimal sub-graphical models |
166
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
207
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
170
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
Active research is being conducted in reducing power consumption of all the components of the Internet. To that end, we propose schemes for power reduction in network switches - T...
265
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
262
Voted
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...