483 search results - page 11 / 97 » Linear Ranking with Reachability |
134
click to vote
SIAMREV
2010
14 years 6 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
113
click to vote
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
85
Voted
WSC
2008
15 years 2 months ago
2008
We develop a Ranking and Selection procedure for selecting the best configuration based on a transient mean performance measure. The procedure extends the OCBA approach to systems...