Sciweavers

1000 search results - page 85 / 200
» Dependency Tree Automata
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—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...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
DLT
2007
15 years 1 months ago
State Complexity of Union and Intersection of Finite Languages
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 ...
Yo-Sub Han, Kai Salomaa
ICWN
2007
15 years 1 months ago
CA Based Data Servicing In Cellular Mobile Network
—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 ...
Sukanta Das, Sipra DasBit, Biplab K. Sikdar
ACL
2006
15 years 1 months ago
A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
Reid Swanson, Andrew S. Gordon
ACL
2006
15 years 1 months ago
Inducing Word Alignments with Bilexical Synchronous Trees
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 ...
Hao Zhang, Daniel Gildea