614 search results - page 91 / 123 » Local Computation: Lower and Upper Bounds |
129
click to vote
LICS
2005
IEEE
15 years 11 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...
160
click to vote
ECCC
2011
15 years 1 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...
161
click to vote
WCNC
2008
IEEE
16 years 14 days 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...
180
click to vote
ML
2012
ACM
14 years 1 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...
142
click to vote
LADC
2005
Springer
15 years 11 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, ...