1282 search results - page 83 / 257 » Signing on signing off |
WABI
2005
Springer
14 years 2 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
CPM
2001
Springer
14 years 1 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
ACCV
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We propose a new principle for recognizing fingerspelling sequences from American Sign Language (ASL). Instead of training a system to recognize the static posture for ea...
CIE
2006
Springer
14 years 28 days ago
2006
Springer
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...