Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Let a Golomb ruler be a set {ai} of integers so that all the differences ai - aj, i ≠ j, are distinct. Let H (I, J) be the smallest n such that there are I disjoint Golomb rulers each containing J elements chosen from {1, 2, ⋯, n}. In 1990, Kløve gave a table of bounds on H(I, J). In this correspondence we improve and extend this table with results found by computer search. © 1998 IEEE.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Limin Hu
IEEE/ACM Transactions on Networking
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Hendrik F. Hamann
InterPACK 2013