6456 search results - page 57 / 1292 » Constraint Solving on Terms |
92
Voted
DEXA
2009
Springer
15 years 7 months ago
2009
Springer
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...
CP
2003
Springer
15 years 6 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
116
Voted
CP
2001
Springer
15 years 5 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
117
click to vote
COMPASS
1991
15 years 4 months ago
1991
: We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the sem...
97
Voted
EMNLP
2006
15 years 2 months ago
2006
Co-occurrence analysis has been used to determine related words or terms in many NLP-related applications such as query expansion in Information Retrieval (IR). However, related w...