2612 search results - page 479 / 523 » Switching Graphs and Their Complexity |
ACL
2010
13 years 6 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 6 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...
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
EMNLP
2010
13 years 6 months ago
2010
Many sequence labeling tasks in NLP require solving a cascade of segmentation and tagging subtasks, such as Chinese POS tagging, named entity recognition, and so on. Traditional p...
EMSOFT
2010
Springer
13 years 6 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...