Sciweavers

109 search results - page 13 / 22
» Classifier Combining Rules Under Independence Assumptions
Sort
View
PODC
2004
ACM
14 years 4 days ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen
IACR
2011
112views more  IACR 2011»
12 years 6 months ago
A Domain Transformation for Structure-Preserving Signatures on Group Elements
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
Melissa Chase, Markulf Kohlweiss
JMLR
2006
107views more  JMLR 2006»
13 years 6 months ago
Consistency of Multiclass Empirical Risk Minimization Methods Based on Convex Loss
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
Di-Rong Chen, Tao Sun
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 1 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
GLOBECOM
2007
IEEE
14 years 1 months ago
V-BLAST Receiver for MIMO Relay Networks with Imperfect CSI
—Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO capability...
Jiansong Chen, Xiaoli Yu, C. C. Jay Kuo