21 search results - page 4 / 5 » Overgenerating Referring Expressions Involving Relations and... |
STACS
2005
Springer
14 years 24 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
ACL
1997
13 years 8 months ago
1997
We present preliminary results concerning robust techniques for resolving bridging definite descriptions. We report our analysis of a collection of 20 Wall Street Journal articles...
BMCBI
2006
13 years 7 months ago
2006
Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in t...
BMCBI
2010
13 years 7 months ago
2010
Background: Cluster analysis, and in particular hierarchical clustering, is widely used to extract information from gene expression data. The aim is to discover new classes, or su...
LACL
2001
Springer
13 years 11 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...