We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
Paulo Jorge S. G. Ferreira, Bruno Jesus, Jose Viei...
A query independent feature, relating perhaps to document content, linkage or usage, can be transformed into a static, per-document relevance weight for use in ranking. The challe...
Nick Craswell, Stephen E. Robertson, Hugo Zaragoza...
For the legal track we used the Wumpus search engine and investigated several methods that have proven successful in other domains, including cover density ranking and Okapi BM25 ...
Research in advanced context-aware systems has clearly shown a need to capture the inherent uncertainty in the physical world, especially in human behavior. Modelling approaches th...
Michael Angermann, Patrick Robertson, Thomas Stran...