1696 search results - page 13 / 340 » Permuted function matching |
ASIACRYPT
2007
Springer
15 years 4 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
ARSCOM
2005
14 years 9 months ago
2005
In [BabStein] Babson and Steingr
WABI
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
DEXA
2009
Springer
15 years 4 months ago
2009
Springer
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...