Sciweavers

20441 search results - page 406 / 4089
» Locally Computable Structures
Sort
View
FLAIRS
2001
15 years 8 months ago
Computing in Formal Knowledge Base Contexts for Natural Language Ambiguity Resolution
Weintroducea formalcontext mechanism,embeddedinto a descriptionlogicsframework,whichis ableto uniformly represent and managedifferent formsof ambiguitiesas theyoccurin the courseo...
Udo Hahn, Martin Romacker
ACL
1990
15 years 7 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
148
Voted
DAM
2008
102views more  DAM 2008»
15 years 6 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
ATAL
2011
Springer
14 years 6 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
DAC
2000
ACM
16 years 7 months ago
Efficient error detection, localization, and correction for FPGA-based debugging
John Lach, William H. Mangione-Smith, Miodrag Potk...