334 search results - page 56 / 67 » Improved Algorithms and Complexity Results for Power Dominat... |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
AAAI
2007
13 years 9 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
ACL
2010
13 years 5 months ago
2010
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
ACL
2010
13 years 5 months ago
2010
Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present a system that combines evidence from a monoling...
LACL
2011
Springer
12 years 10 months ago
2011
Springer
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...