550 search results - page 106 / 110 » pairing 2009 |
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
ICB
2009
Springer
14 years 4 months ago
2009
Springer
Law enforcement agencies routinely collect both rolled and plain fingerprints of all the ten fingers of suspects. These two types of fingerprints complement each other, since ro...
IFIP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
IWANN
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. ZARAMIT is an information system capable of fully automated phylogeny reconstruction. Methods have been tailored to mitochondrial DNA sequences, with focus on subproblem ...