Sciweavers

4674 search results - page 110 / 935
» cases 2008
Sort
View
DAM
2008
62views more  DAM 2008»
15 years 6 months ago
The edge-diametric theorem in Hamming spaces
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...
Christian Bey
CCCG
2008
15 years 7 months ago
Recognition of Largest Empty Orthoconvex Polygon in a Point Set
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...
ENTCS
2008
84views more  ENTCS 2008»
15 years 6 months ago
Comparing Three Coordination Models: Reo, ARC, and RRD
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...
Carolyn L. Talcott, Marjan Sirjani, Shangping Ren
DM
2006
68views more  DM 2006»
15 years 6 months ago
A note on maximally repeated sub-patterns of a point set
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,...
Véronique Cortier, Xavier Goaoc, Mira Lee, ...
ACL
2008
15 years 7 months ago
Enriching Morphologically Poor Languages for Statistical Machine Translation
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...
Eleftherios Avramidis, Philipp Koehn