Sciweavers

1132 search results - page 223 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
AAAI
2010
13 years 8 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
ICISC
1998
110views Cryptology» more  ICISC 1998»
13 years 8 months ago
The nonhomomorphicity of S-boxes
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
Yuliang Zheng, Xian-Mo Zhang
ATAL
2010
Springer
13 years 7 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
BMCBI
2010
175views more  BMCBI 2010»
13 years 6 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 6 months ago
Strategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...