933 search results - page 109 / 187 » Monotone Complexity of a Pair |
119
click to vote
ACL
1998
15 years 7 months ago
1998
This paper reports the results of a preliminary experiment on the detection of semantic variants of terms in a French technical document. The general goal of our work is to help t...
159
click to vote
IJCAI
1997
15 years 7 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
165
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
180
click to vote
ECCC
2006
15 years 6 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
142
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...