Sciweavers

588 search results - page 89 / 118
» Improving web search results using affinity graph
Sort
View
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
SIGIR
2004
ACM
15 years 3 months ago
Human versus machine in the topic distillation task
This paper reports on and discusses a set of user experiments using the TREC 2003 Web interactive track protocol. The focus is on comparing humans and machine algorithms in terms ...
Mingfang Wu, Gheorghe Muresan, Alistair McLean, Mu...
EACL
2006
ACL Anthology
14 years 11 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre
TWC
2008
145views more  TWC 2008»
14 years 8 months ago
Generalized Window-Based PN Acquisition Scheme in CDMA Spread Spectrum Systems
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
Kwang Man Ok, Chung Gu Kang
WWW
2007
ACM
15 years 10 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...