3657 search results - page 436 / 732 » A Study of Practical Deduplication |
215
click to vote
ASIACRYPT
2011
Springer
14 years 6 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
175
Voted
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
181
click to vote
DGO
2011
14 years 6 months ago
2011
We consider open government (OG) within the context of egovernment and its broader implications for the future of public administration. We argue that the current US Administratio...
277
click to vote
PEPM
2007
ACM
17 years 4 months ago
2007
ACM
programming languages community is vigorously pursuing ways to incorporate F!-style indexed types into programming languages. This paper advocates Concoqtion, a practical approach ...
217
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...