1871 search results - page 12 / 375 » The Ephemeral Pairing Problem |
STACS
1990
Springer
13 years 11 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...
CISC
2007
Springer
13 years 11 months ago
2007
Springer
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. Segmentation and blind restoration are both classical problems, that are known to be difficult and have attracted major research efforts. This paper shows that the two pr...