523 search results - page 74 / 105 » Decidability of string graphs |
143
click to vote
EACL
2009
ACL Anthology
15 years 1 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
136
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
We present the results of an empirical study evaluating the precision of subset-based points-to analysis with several variations of context sensitivity on Java benchmarks of signif...
145
click to vote
ECCC
2010
15 years 22 days ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
168
click to vote
PKDD
2004
Springer
15 years 8 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
117
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...