We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...