Sciweavers

7796 search results - page 261 / 1560
» On Generalized Schur Numbers
Sort
View
ECCC
2006
109views more  ECCC 2006»
15 years 6 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
DM
2007
68views more  DM 2007»
15 years 6 months ago
Extension of Arrow's theorem to symmetric sets of tournaments
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
Eyal Beigman
SIGECOM
2008
ACM
81views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Self-financed wagering mechanisms for forecasting
We examine a class of wagering mechanisms designed to elicit truthful predictions from a group of people without requiring any outside subsidy. We propose a number of desirable pr...
Nicolas S. Lambert, John Langford, Jennifer Wortma...
TCS
2008
15 years 6 months ago
Sequential vs. parallel complexity in simple gene assembly
We investigate some differences between the general intramolecular model for gene assembly and its restricted simple model. Although both models satisfactorily sort all current ex...
Miika Langille, Ion Petre
CANDC
2000
ACM
15 years 6 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...