614 search results - page 91 / 123 » Local Computation: Lower and Upper Bounds |
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
ECCC
2011
13 years 4 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
WCNC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We consider a scenario in which frequency agile radios opportunistically share a fixed spectrum resource with a set of primary nodes. We develop a collaborative scheme...
ML
2012
ACM
12 years 5 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
LADC
2005
Springer
14 years 3 months ago
2005
Springer
We present a framework for building fail-safe hard real-time applications in timed asynchronous distributed systems subject to communication partitions and performance, omission, ...