Sciweavers

324 search results - page 20 / 65
» Bounds for Functions of Dependent Risks
Sort
View
ICCD
1995
IEEE
100views Hardware» more  ICCD 1995»
15 years 3 months ago
Transformation of min-max optimization to least-square estimation and application to interconnect design optimization
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...
Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
IJCNN
2007
IEEE
15 years 6 months ago
Evaluation of Performance Measures for SVR Hyperparameter Selection
— To obtain accurate modeling results, it is of primal importance to find optimal values for the hyperparameters in the Support Vector Regression (SVR) model. In general, we sea...
Koen Smets, Brigitte Verdonk, Elsa Jordaan
ECCC
2011
183views ECommerce» more  ECCC 2011»
14 years 6 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 1 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan