Sciweavers

3483 search results - page 655 / 697
» Forward
Sort
View
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ADHOCNOW
2009
Springer
14 years 10 months ago
An Efficient and Scalable Address Autoconfiguration in Mobile Ad Hoc Networks
Several protocols of address autoconfiguration in the mobile ad hoc network (MANET) are present in the current literature. Although some of these protocols perform decently in spar...
Syed Rafiul Hussain, Subrata Saha, Ashikur Rahman
BIRTHDAY
2009
Springer
14 years 10 months ago
Towards the Automatic Acquisition of a Valence Dictionary for Polish
This article presents the evaluation of a valence dictionary for Polish produced with the help of shallow parsing techniques and compares those results to earlier results involving...
Adam Przepiórkowski
CONEXT
2009
ACM
14 years 10 months ago
Virtually eliminating router bugs
Software bugs in routers lead to network outages, security vulnerabilities, and other unexpected behavior. Rather than simply crashing the router, bugs can violate protocol semant...
Eric Keller, Minlan Yu, Matthew Caesar, Jennifer R...
ICFP
2010
ACM
14 years 10 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...