We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Abstract. Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars writ...
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...
Keven Ates, Jacek P. Kukluk, Lawrence B. Holder, D...
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...