12 papers:
ICML-2015-RajkumarGL0 #probability #ranking #set- Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top (AR, SG, LHL, SA), pp. 665–673.
ICALP-v1-2013-Grier #finite #game studies- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (DG), pp. 497–503.
CSEET-2011-LiB #education #process #re-engineering #research #validation #verification- Making winners for both education and research: Verification and validation process improvement practice in a software engineering course (QL, BWB), pp. 304–313.
- CSEET-2006-GrunbacherSBIKP #approach #education #re-engineering #student
- Making Every Student a Winner: The WinWin Approach in Software Engineering Education (PG, NS, ROB, HPI, HK, DP), pp. 201–208.
ICPR-v2-2006-YangLWW #clustering #markov #robust- Robust Clustering based on Winner-Population Markov Chain (FWY, HJL, PSPW, HHW), pp. 589–592.
- ICPR-v3-2006-LiuWL #estimation #performance
- Winner Update on Walsh-Hadamard Domain for Fast Motion Estimation (SWL, SDW, SHL), pp. 794–797.
SAC-2005-EbertG #approach- A “Go With the Winners” approach to finding frequent patterns (TE, DG), pp. 498–502.
- SAC-2005-FradkinK #classification #learning
- Methods for learning classifier combinations: no clear winner (DF, PBK), pp. 1038–1043.
STOC-2004-BeierV #optimisation- Typical properties of winners and losers in discrete optimization (RB, BV), pp. 343–352.
DATE-2002-Ratford #design #memory management- Make Your SoC Design a Winner: Select the Right Memory IP (VR), p. 15.
- ICPR-v2-2000-ChenHF #algorithm #nearest neighbour
- Winner-Update Algorithm for Nearest Neighbor Search (YSC, YPH, CSF), pp. 2704–2707.
- STOC-1996-AwerbuchAFL #how #nondeterminism
- Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract) (BA, YA, AF, FTL), pp. 519–530.
