3415 search results - page 68 / 683 » Lower Bounds for Kernelizations |
142
Voted
ASIACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
112
Voted
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
121
Voted
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
106
Voted
STOC
2002
ACM
16 years 4 months ago
2002
ACM
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).