392 search results - page 5 / 79 » Maximal Completion |
DNA
2004
Springer
13 years 11 months ago
2004
Springer
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
GD
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
IJCGA
2000
13 years 5 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
VTC
2010
IEEE
13 years 4 months ago
2010
IEEE
– This paper provides a partial answer to the question: "what is the best angular density of multipath in MIMO channels?" using the size-asymptotic theory of Toeplitz m...