465 search results - page 39 / 93 » On the Hardness of Range Assignment Problems |
117
click to vote
COLING
2010
14 years 10 months ago
2010
Coreference resolution is a classic NLP problem and has been studied extensively by many researchers. Most existing studies, however, are generic in the sense that they are not fo...
113
click to vote
JCO
2006
15 years 3 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
133
Voted
IJSR
2010
15 years 2 months ago
2010
Abstract— People in densely populated environments typically form groups that split and merge. In this paper we track groups of people so as to reflect this formation process an...
140
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
125
Voted
IJAR
2006
15 years 3 months ago
2006
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...