2084 search results - page 225 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
84
Voted
COMCOM
2004
14 years 10 months ago
2004
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
85
Voted
JMLR
2006
14 years 10 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
71
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
PVLDB
2010
14 years 8 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
PODS
2010
ACM
15 years 3 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...