440 search results - page 11 / 88 » On partial randomness |
DM
2007
14 years 9 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
CVIU
2004
14 years 9 months ago
2004
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
110
click to vote
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...