We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...