152 search results - page 17 / 31 » Robust Polynomials and Quantum Algorithms |
ATAL
2006
Springer
14 years 6 days ago
2006
Springer
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
ICVGIP
2004
13 years 9 months ago
2004
Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear distortions and noise obtained during the fingerprint ...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
PODC
1990
ACM
14 years 15 days ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
CSL
2002
Springer
13 years 8 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...