Sciweavers

6202 search results - page 6 / 1241
» Without Loss of Generality
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
JCST
2008
119views more  JCST 2008»
14 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
TIT
1998
96views more  TIT 1998»
14 years 9 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth
ECAI
2004
Springer
15 years 3 months ago
A Generalized Quadratic Loss for Support Vector Machines
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...
Filippo Portera, Alessandro Sperduti
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 2 months ago
Generalized Model Predictive Direct Torque Control: Long prediction horizons and minimization of switching losses
Abstract— This paper presents a generalized Model Predictive Direct Torque Control scheme with an extended horizon, which is composed of multiple hinges (groups of switch transit...
Tobias Geyer