2492 search results - page 248 / 499 » On the General Signature Trees |
196
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
183
click to vote
COMCOM
2004
15 years 6 months ago
2004
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
159
click to vote
JOLLI
2010
15 years 5 months ago
2010
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
177
click to vote
WINET
2010
15 years 5 months ago
2010
Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon dete...
189
click to vote
ISDA
2010
IEEE
15 years 4 months ago
2010
IEEE
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...