4212 search results - page 52 / 843 » On Compressible Pairings and Their Computation |
138
Voted
COMGEO
2011
ACM
14 years 7 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
134
Voted
EGH
2011
Springer
14 years 10 days ago
2011
Springer
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
104
click to vote
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
The classical approach to depth from defocus uses two
images taken with circular apertures of different sizes. We
show in this paper that the use of a circular aperture
severely...
80
Voted
CARDIS
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...
107
Voted
ACL
2010
14 years 10 months ago
2010
In this paper we describe an intuitionistic method for dependency parsing, where a classifier is used to determine whether a pair of words forms a dependency edge. And we also pro...