Sciweavers

304 search results - page 25 / 61
» Generalized interpolation in CASL
Sort
View
ASIACRYPT
2004
Springer
15 years 3 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
IVC
2000
107views more  IVC 2000»
14 years 9 months ago
View synthesis by trinocular edge matching and transfer
This paper presents a novel automatic method for view synthesis (or image transfer) from a triplet of uncalibrated images based on trinocular edge matching followed by transfer by...
Stephen Pollard, Maurizio Pilu, Sean Hayes, Adele ...
FSTTCS
2010
Springer
14 years 7 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák
POPL
2008
ACM
15 years 10 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
SIAMJO
2011
14 years 4 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye