550 search results - page 35 / 110 » A general magnitude-preserving boosting algorithm for search... |
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a...
EDBT
2010
ACM
13 years 9 months ago
2010
ACM
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
AIR
2004
13 years 7 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...