1302 search results - page 80 / 261 » On the Strong Chromatic Number |
152
click to vote
ORDER
2002
15 years 6 months ago
2002
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
182
click to vote
FOCM
2010
15 years 5 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
152
click to vote
ACL
2009
15 years 4 months ago
2009
We examine correlations between native speaker judgements on automatically generated German text against automatic evaluation metrics. We look at a number of metrics from the MT a...
237
click to vote
LADC
2011
Springer
14 years 9 months ago
2011
Springer
—We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
163
click to vote
EUROCRYPT
2007
Springer
16 years 18 days ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...