Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
A machine model in which load operations can be performed in parallel with arithmetic operations by two separate functional units is considered. For this model, the evaluation of a set of expression trees is discussed. A dynamic programming algorithm for producing an approximate solution is described and analyzed. For binary trees its worse-case cost is at most min (1.091, 1 + (2 log n)/n) times the optimal cost.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Robert C. Durbeck
IEEE TACON
David A. Selby
IBM J. Res. Dev