828 search results - page 11 / 166 » Bounded Hairpin Completion |
VL
2000
IEEE
13 years 12 months ago
2000
IEEE
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
GD
1999
Springer
13 years 11 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...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...
DBSEC
2006
13 years 9 months ago
2006
Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
EJC
2007
13 years 7 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...