Sciweavers

5372 search results - page 372 / 1075
» complexity 2007
Sort
View
ACL
2000
15 years 8 months ago
A Unified Statistical Model for the Identification of English BaseNP
This paper presents a novel statistical model for automatic identification of English baseNP. It uses two steps: the Nbest Part-Of-Speech (POS) tagging and baseNP identification g...
Endong Xun, Changning Huang, Ming Zhou
ACL
1998
15 years 8 months ago
Reference Resolution beyond Coreference: a Conceptual Frame and its Application
A model for reference use in communication is proposed, from a representationist point of view. Both the sender and the receiver of a message handle representations of their commo...
Andrei Popescu-Belis, Isabelle Robba, Gérar...
ACL
1998
15 years 8 months ago
Restrictions on Tree Adjoining Languages
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
Giorgio Satta, William Schuler
SIROCCO
2003
15 years 8 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
DBSEC
2000
95views Database» more  DBSEC 2000»
15 years 8 months ago
Wrappers - a mechanism to support state-based authorisation in Web applications
The premises of this paper are 1) security is application dependent because application semantics directly influence proper protection; but 2) applications are generally too compl...
Martin S. Olivier, Ehud Gudes