Sciweavers

1716 search results - page 155 / 344
» Proving Conditional Termination
Sort
View
90
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 23 days ago
A tight quantitative version of Arrow's impossibility theorem
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
Nathan Keller
87
Voted
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 23 days ago
Standard Logics Are Valuation-Nonmonotonic
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
Mladen Pavicic, Norman D. Megill
94
Voted
COMBINATORICS
2006
115views more  COMBINATORICS 2006»
15 years 22 days ago
Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
Catalin Zara
105
Voted
COMBINATORICA
2007
117views more  COMBINATORICA 2007»
15 years 20 days ago
Embedding nearly-spanning bounded degree trees
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
Noga Alon, Michael Krivelevich, Benny Sudakov
100
Voted
JMLR
2008
83views more  JMLR 2008»
15 years 20 days ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby