QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
A correspondence between linear (n,k,d) codes and algorithms for computing a system Ψ of k bilinear forms is established under which the codelength n is equal to the multiplicative complexity of the algorithm for computing Ψ, and the code distance d is underbounded by the minimum number of multiplications required to compute any linear combination of the k forms in Ψ. This hitherto unexplored approach to linear codes holds promise of a better understanding of the structure of existing codes as well as for methods of constructing new codes with prescribed rate and distance. © 1977, IEEE. All rights reserved.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Eric Price, David P. Woodruff
FOCS 2011