Sciweavers

1763 search results - page 343 / 353
» A Formalization of Polytime Functions
Sort
View
RANLP
2003
14 years 16 days ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
ACL
1994
14 years 15 days ago
Priority Union and Generalization in Discourse Grammars
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for re...
Claire Grover, Chris Brew, Suresh Manandhar, Marc ...
LFP
1992
140views more  LFP 1992»
14 years 10 days ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
APWEB
2008
Springer
14 years 9 days ago
Protecting Information Sharing in Distributed Collaborative Environment
Abstract. Information sharing on distributed collaboration usually occurs in broad, highly dynamic network-based environments, and formally accessing the resources in a secure mann...
Min Li, Hua Wang
ATAL
2010
Springer
14 years 9 days ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko