Sciweavers

14704 search results - page 129 / 2941
» computing 2007
Sort
View
ACL
1989
15 years 4 months ago
A Computational Mechanism for Pronominal Reference
the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The a...
Robert Ingria, David Stallard
ACL
1990
15 years 4 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
AMC
2007
112views more  AMC 2007»
15 years 3 months ago
Computing moments of free additive convolution of measures
This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants and the moments of measures without sophisticated programming...
Wlodzimierz Bryc
APAL
2006
91views more  APAL 2006»
15 years 3 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
Makoto Kanazawa
BMCBI
2004
86views more  BMCBI 2004»
15 years 2 months ago
A computer simulation analysis of the accuracy of partial genome sequencing and restriction fragment analysis in estimating gene
Background: Determination of genetic relatedness among microorganisms provides information necessary for making inferences regarding phylogeny. However, there is little informatio...
Baozhen Qiao, Ronald M. Weigel