TIT

2010

13 years 2 months ago
2010

Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...

SIAMADS

2010

13 years 2 months ago
2010

Reduced-order models of the nonlinear complex Ginzburg

DM

2002

13 years 7 months ago
2002

Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balance...

JCO

2007

13 years 7 months ago
2007

Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...

JCO

2007

13 years 7 months ago
2007

A graph G is said to be m-sufﬁcient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...

MP

2006

13 years 7 months ago
2006

A 0/

EJC

2007

13 years 7 months ago
2007

Balanced incomplete-block designs (BIBDs) with repeated blocks are studied and constructed. We continue work initiated by van Lint and Ryser in 1972 and pursued by van Lint in 197...

IJAC

2006

13 years 7 months ago
2006

There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...

DATAMINE

2006

13 years 7 months ago
2006

Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...

DM

2010

13 years 8 months ago
2010

A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...