143 search results - page 1 / 29 » How to rank with few errors |
ECCC
2006
13 years 4 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
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...
SIGSOFT
2004
ACM
13 years 9 months ago
2004
ACM
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh blockfading channels. A heavily coded system corresponds to a low transmiss...
EMNLP
2010
13 years 2 months ago
2010
Confidence-Weighted linear classifiers (CW) and its successors were shown to perform well on binary and multiclass NLP problems. In this paper we extend the CW approach for sequen...