Sciweavers

2018 search results - page 317 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2011
Springer
14 years 6 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 11 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 10 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
IOPADS
1996
87views more  IOPADS 1996»
15 years 7 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
CORR
2008
Springer
119views Education» more  CORR 2008»
15 years 6 months ago
Self-stabilizing Numerical Iterative Computation
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...
Ezra N. Hoch, Danny Bickson, Danny Dolev