6045 search results - page 1026 / 1209 » Computable Linearizations of Well-partial-orderings |
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
ESAS
2007
Springer
14 years 3 months ago
2007
Springer
The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been a...
EUROCRYPT
2007
Springer
14 years 3 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
CVPR
2009
IEEE
14 years 3 months ago
2009
IEEE
We present a new shape-from-distortion framework for recovering specular (reflective/refractive) surfaces. While most existing approaches rely on accurate correspondences between 2...