483 search results - page 11 / 97 » Linear Ranking with Reachability |
SIAMREV
2010
13 years 2 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
14 years 27 days 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...
ASIACRYPT
2001
Springer
13 years 11 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
13 years 7 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...
WSC
2008
13 years 10 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...