—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
—This work presents an efficient data service scheme for location dependent data/objects in a cellular mobile network. It is developed around the hardware structure of cellular ...
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
This paper compares different bilexical tree-based models for bilingual alignment. EM training for the new model benefits from the dynamic programming "hook trick". The ...