787 search results - page 92 / 158 » Polynomial Constants are Decidable |
153
click to vote
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
142
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
164
click to vote
CIS
2004
Springer
15 years 11 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
175
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
153
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...