Sciweavers

Share
143 search results - page 1 / 29
» How to rank with few errors
Sort
View
ECCC
2006
109views more  ECCC 2006»
10 years 11 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
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...
Claire Kenyon-Mathieu, Warren Schudy
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
12 years 16 hour 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
SIGSOFT
2004
ACM
11 years 5 months ago
Correlation exploitation in error ranking
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...
Ted Kremenek, Ken Ashcraft, Junfeng Yang, Dawson R...
GLOBECOM
2009
IEEE
11 years 6 months ago
Coding Versus ARQ in Fading Channels: How Reliable Should the PHY Be?
—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...
Peng Wu, Nihar Jindal
EMNLP
2010
10 years 9 months ago
Confidence in Structured-Prediction Using Confidence-Weighted Models
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...
Avihai Mejer, Koby Crammer
books