789 search results - page 123 / 158 » On Theory Revision with Queries |
109
click to vote
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
129
Voted
ICAIL
2005
ACM
15 years 6 months ago
2005
ACM
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
104
Voted
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
106
click to vote
AAAI
2006
15 years 2 months ago
2006
Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences ...
120
click to vote
CIKM
2011
Springer
14 years 19 days ago
2011
Springer
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...