Sciweavers

727 search results - page 102 / 146
» Toward Conversation Retrieval
Sort
View
CIKM
2009
Springer
14 years 4 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
JCDL
2005
ACM
156views Education» more  JCDL 2005»
14 years 3 months ago
A generic alerting service for digital libraries
Users of modern digital libraries (DLs) can keep themselves up-to-date by searching and browsing their favorite collections, or more conveniently by resorting to an alerting servi...
George Buchanan, Annika Hinze
DBSEC
2004
108views Database» more  DBSEC 2004»
13 years 11 months ago
Why Is this User Asking so Many Questions? Explaining Sequences of Queries
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
Aybar C. Acar, Amihai Motro
WWW
2010
ACM
14 years 5 months ago
New-web search with microblog annotations
Web search engines discover indexable documents by recursively ‘crawling’ from a seed URL. Their rankings take into account link popularity. While this works well, it introduc...
Tom Rowlands, David Hawking, Ramesh Sankaranarayan...
CIKM
2010
Springer
13 years 8 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang