Sciweavers

76 search results - page 9 / 16
» Linear-Time Ranking of Permutations
Sort
View
JCSS
2002
95views more  JCSS 2002»
15 years 3 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
TSP
2011
96views more  TSP 2011»
14 years 10 months ago
A Signal Processing Approach to Fourier Analysis of Ranking Data: The Importance of Phase
—Ranking data is a type of data obtained in some elections, in customer surveys, as well as from web search results. Such data may be considered as a type of signal defined on t...
Ramakrishna Kakarala
AAAI
2006
15 years 5 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICML
2007
IEEE
16 years 4 months ago
Learning to rank: from pairwise approach to listwise approach
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, Han...
137
Voted
BMCBI
2008
99views more  BMCBI 2008»
15 years 3 months ago
Ranking analysis of F-statistics for microarray data
Background: Microarray technology provides an efficient means for globally exploring physiological processes governed by the coordinated expression of multiple genes. However, ide...
Yuan-De Tan, Myriam Fornage, Hongyan Xu