A maximal repetition, or run, in a string, is periodic substring whose smallest period at most half the length of substring. In this paper, we consider runs that correspond to path on trie, other words, rooted edge-labeled tree where each edge labeled with single symbol, and endpoints must be descendant/ancestor other. For trie n edges, show number less than n. We also an asymptotic lower bound...

This paper describes the IBM systems for the Trilingual Entity Discovery and Linking (EDL) for the TAC 2015 KnowledgeBase Population track. The entity discovery or mention detection (MD) system is based on system combination of deep neural networks and conditional random fields. The entity linking (EL) system is based on a language independent probabilistic disambiguation model. The same EL mod...

We study the effects of dimension-six operators contributing to the gtt̄ vertex in top quark pair production at the Tevatron collider. We derive both the limits from Run 1 data and the potential bounds from future runs (Run 2 and 3). Although the current constraints are not very strong, the future runs are quite effective in probing these operators. We investigate the possibility of disentanglin...