7123 search results - page 327 / 1425 » The Ordered Set of Rough Sets |
145
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
127
click to vote
IPM
2006
15 years 6 months ago
2006
Are two adjectives worth the same as a single noun when documents are ordered based on decreasing topicality? We propose an easy to interpret single number Relative Feature Utilit...
188
click to vote
IPM
2007
15 years 6 months ago
2007
This papers studies a special “small” information retrieval problem where user satisfaction only depends on the ordering of documents. We look for a retrieval performance meas...
131
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
144
click to vote
PR
2000
15 years 6 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...