Sciweavers

568 search results - page 89 / 114
» New bounds for the Cebysev functional
Sort
View
ICISC
1998
110views Cryptology» more  ICISC 1998»
13 years 9 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
COR
2008
97views more  COR 2008»
13 years 7 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...
COMPUTING
2006
100views more  COMPUTING 2006»
13 years 7 months ago
Interval Arithmetic with Containment Sets
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
John D. Pryce, George F. Corliss
ATMOS
2007
152views Optimization» more  ATMOS 2007»
13 years 9 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
NIPS
2008
13 years 9 months ago
Privacy-preserving logistic regression
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
Kamalika Chaudhuri, Claire Monteleoni