8512 search results - page 244 / 1703 » Computing Theory With Relevance |
146
Voted
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
168
Voted
EMSOFT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
128
Voted
ACL
1997
15 years 6 months ago
1997
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
145
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
167
click to vote
ECCC
2008
15 years 5 months ago
2008
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...