QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Finite-state encoders that encode n-ary data into a constrained system S are considered. The anticipation, or decoding delay, of such an (5, n ) -encoder is the number of symbols that a state-dependent decoder needs to look ahead in order to recover the current input symbol. Upper bounds are obtained on the smallest attainable number of states of any (S, n)-encoder with anticipation t. Those bounds can be explicitly computed from t and S, which implies that the problem of checking whether there is an (5, n) -encoder with anticipation t is decidable. It is also shown that if there is an (S, n) -encoder with anticipation t, then a version of the state-splitting algorithm can be applied to produce an (S, n) encoder with anticipation at most It- 1. We also observe that the problem of checking whether there is an (S, n)-encoder having a sliding-block decoder with a given memory and anticipation is decidable. © 1996 IEEE.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science