1871 search results - page 3 / 375 » The Ephemeral Pairing Problem |
JSYML
2007
13 years 7 months ago
2007
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
RECOMB
2001
Springer
14 years 7 months ago
2001
Springer
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
FSTTCS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
APWEB
2010
Springer
13 years 10 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...