3356 search results - page 15 / 672 » Determining Consensus Numbers |
BMCBI
2007
13 years 7 months ago
2007
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...
DM
2000
13 years 7 months ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
ALGORITHMICA
2011
13 years 2 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
ENDM
2008
13 years 7 months ago
2008
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
SMC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we experimentally implement and validate distributed consensus algorithms on a mobile actuator and sensor network platform under directed, possibly switching int...