Sciweavers

2252 search results - page 57 / 451
» Improving Random Forests
Sort
View
COMPSAC
2009
IEEE
13 years 11 months ago
Practical Extensions of a Randomized Testing Tool
—Many efficient random testing algorithms for object-oriented software have been proposed due to their simplicity and reasonable code coverage; however, even the stateof-the-art...
Hojun Jaygarl, Carl K. Chang, Sunghun Kim
ICC
2008
IEEE
101views Communications» more  ICC 2008»
14 years 2 months ago
SINR Estimation in Random Beamforming with Noisy MIMO Channel Measurements
—An improved SINR metric is proposed for the random beamforming scheme introduced by Sharif and Hassibi, when the channel observation used to compute the SINR is known to be nois...
Roland Tresch, Maxime Guillaud
JOC
2010
124views more  JOC 2010»
13 years 6 months ago
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
We present a new encryption scheme which is secure against adaptive chosenciphertext attack (or CCA2-secure) in the standard model (i.e. without the use of random oracle). Our sch...
Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Vict...
WSC
2001
13 years 9 months ago
Using common random numbers for indifference-zone selection
This paper discusses the validity of using common random numbers (CRNs) with two-stage selection procedures to improve the possibility of correct selection and discusses the intri...
E. Jack Chen
ANTS
2004
Springer
112views Algorithms» more  ANTS 2004»
14 years 1 months ago
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
Kirsten Eisenträger, Kristin Lauter, Peter L....