Sciweavers

76 search results - page 8 / 16
» Linear-Time Ranking of Permutations
Sort
View
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 2 months ago
Generalized Gray Codes for Local Rank Modulation
—We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rankmodulation is...
Eyal En Gad, Michael Langberg, Moshe Schwartz, Jeh...
JMLR
2010
135views more  JMLR 2010»
13 years 2 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
WWW
2010
ACM
14 years 2 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
APL
1998
ACM
13 years 12 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky