152 search results - page 24 / 31 » Constructive Proofs of Concentration Bounds |
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...