2455 search results - page 132 / 491 » Computability of Models for Sequence Assembly |
CSFW
2007
IEEE
14 years 3 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
IDA
2003
Springer
14 years 2 months ago
2003
Springer
This paper presents an alternative to distance-based neural networks. A distance measure is the underlying property on which many neural models rely, for example self-organizing ma...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
VLSM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we describe a new framework for the tracking of closed curves described through implicit surface modeling. The approach proposed here enables a continuous tracking al...