550 search results - page 4 / 110 » pairing 2009 |
PKC
2009
Springer
14 years 6 months ago
2009
Springer
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
CADE
2009
Springer
14 years 6 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
RTA
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
RTA
2009
Springer
14 years 10 days ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
ICCV
2009
IEEE
14 years 10 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...