Sciweavers

1441 search results - page 31 / 289
» Multiple instance ranking
Sort
View
DAGSTUHL
2007
13 years 11 months ago
Measuring Ranks via the Complete Laws of Iterated Contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
Wolfgang Spohn
JMLR
2010
136views more  JMLR 2010»
13 years 4 months ago
Evaluation Method for Feature Rankings and their Aggregations for Biomarker Discovery
In this paper we investigate the problem of evaluating ranked lists of biomarkers, which are typically an output of the analysis of high-throughput data. This can be a list of pro...
Ivica Slavkov, Bernard Zenko, Saso Dzeroski
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
14 years 2 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik
PC
2007
161views Management» more  PC 2007»
13 years 9 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...