2018 search results - page 96 / 404 » Magnitude-preserving ranking algorithms |
182
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
276
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
166
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
156
Voted
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
151
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Interpretation of simple microarray experiments is usually based on the fold-change of gene expression between a reference and a "treated" sample where the t...