3116 search results - page 237 / 624 » Recovering |
104
Voted
USENIX
2007
15 years 3 months ago
2007
The fuzzy file block matching technique (fuzzy matching for short), was first proposed for opportunistic use of Content Addressable Storage. Fuzzy matching aims to increase the ...
115
Voted
AMDO
2008
Springer
15 years 2 months ago
2008
Springer
Detection of humans and estimation of their 2D poses from a single image are challenging tasks. This is especially true when part of the observation is occluded. However, given a l...
101
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
153
click to vote
CANS
2008
Springer
15 years 2 months ago
2008
Springer
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
100
click to vote
CC
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...