3356 search results - page 58 / 672 » Determining Consensus Numbers |
DM
2006
13 years 8 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
MOC
1998
13 years 8 months ago
1998
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, we study the cheap control problem and determine what some of the inherent system limitations are in achieving high performance for LTI systems. In particular, we ob...
TCOM
2008
13 years 8 months ago
2008
In this paper, a new information theoretic algorithm is proposed for signal enumeration in DS-CDMA networks. The approach is based on the predictive description length (PDL) of the...
COMBINATORICS
2000
13 years 8 months ago
2000
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...