5448 search results - page 738 / 1090 » Breakpoints and Time in Distributed Computations |
183
click to vote
IPOM
2007
Springer
16 years 29 days ago
2007
Springer
It is by now widely accepted that the arrival process of aggregate network traffic exhibits self-similar characteristics which result in the preservation of traffic burstiness (hig...
195
click to vote
IM
2007
15 years 6 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
209
click to vote
ECCC
2011
15 years 1 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
248
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
Cloud-based data management platforms often employ multitenant databases, where service providers achieve economies of scale by consolidating multiple tenants on shared servers. I...
227
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...