Sciweavers

2252 search results - page 81 / 451
» Improving Random Forests
Sort
View
FSE
2008
Springer
105views Cryptology» more  FSE 2008»
13 years 9 months ago
An Improved Security Bound for HCTR
HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the au...
Debrup Chakraborty, Mridul Nandi
CCS
2010
ACM
13 years 8 months ago
Algebraic pseudorandom functions with improved efficiency from the augmented cascade
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade constructio...
Dan Boneh, Hart William Montgomery, Ananth Raghuna...
PRL
2006
144views more  PRL 2006»
13 years 8 months ago
Astronomical image restoration using an improved anisotropic diffusion
Images secured from an astronomical telescope usually suffer from blur and from interference that scientists refer to as ``noise''. Therefore, good image restoration tec...
Shin-Min Chao, Du-Ming Tsai
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 7 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
PIMRC
2010
IEEE
13 years 6 months ago
How to improve the performance in Delay Tolerant Networks under Manhattan Mobility Model
Delay Tolerant networks (DTNs) are one type of wireless networks where the number of nodes per unit area is small and hence the connectivity between the nodes is intermittent. In t...
Mouna Abdelmoumen, Eya Dhib, Mounir Frikha, Tijani...