2880 search results - page 258 / 576 » Approximate Range Searching |
143
click to vote
IJCAI
2003
15 years 5 months ago
2003
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...
145
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
101
Voted
PAMI
1998
15 years 3 months ago
1998
—In this paper, we describe a flexible form-reader system capable of extracting textual information from accounting documents, like invoices and bills of service companies. In th...
168
click to vote
IWPEC
2010
Springer
15 years 1 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
119
click to vote
ACL
2009
15 years 1 months ago
2009
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...