The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswed...
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab...
Three models of coordination--Reo, Actors-Roles-Coordinators (ARC), and Reflective Russian Dolls (RRD)--are compared and contrasted according to a set of coordination features. Ma...
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
We address the problem of translating from morphologically poor to morphologically rich languages by adding per-word linguistic information to the source language. We use the synt...