Sciweavers

7215 search results - page 92 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 8 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
ICALP
2005
Springer
14 years 1 months ago
The Polyranking Principle
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
NIPS
2008
13 years 9 months ago
Overlaying classifiers: a practical approach for optimal ranking
ROC curves are one of the most widely used displays to evaluate performance of scoring functions. In the paper, we propose a statistical method for directly optimizing the ROC cur...
Stéphan Clémençon, Nicolas Va...
CSDA
2010
132views more  CSDA 2010»
13 years 8 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
TKDE
2010
160views more  TKDE 2010»
13 years 6 months ago
Using Proximity Search to Estimate Authority Flow
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...