Sciweavers

4428 search results - page 854 / 886
» The Chow Parameters Problem
Sort
View
MCS
2010
Springer
15 years 3 months ago
Dynamic Selection of Ensembles of Classifiers Using Contextual Information
In a multiple classifier system, dynamic selection (DS) has been used successfully to choose only the best subset of classifiers to recognize the test samples. Dos Santos et al...
Paulo Rodrigo Cavalin, Robert Sabourin, Ching Y. S...
ATMOS
2008
101views Optimization» more  ATMOS 2008»
15 years 3 months ago
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...
Spyros C. Kontogiannis, Christos D. Zaroliagis
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 3 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
AAAI
2010
15 years 3 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...
DAGSTUHL
2007
15 years 3 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois