Sciweavers

476 search results - page 77 / 96
» Spread Codes and Spread Decoding in Network Coding
Sort
View
FLAIRS
2001
14 years 11 months ago
Introducing Local Optimization for Effective Initialization and Crossover of Genetic Decision Trees
We introduce a new genetic operator, Reduction, that rectifies decision trees not correct syntactically and at the same time removes the redundant sections within, while preservin...
Arindam Basak, Sudeshna Sarkar
CPHYSICS
2008
79views more  CPHYSICS 2008»
14 years 9 months ago
Atmospheric MUons from PArametric formulas: a fast GEnerator for neutrino telescopes (MUPAGE)
Abstract. Neutrino telescopes are opening new opportunities in observational high energy astrophysics. In these detectors, atmospheric muons from primary cosmic ray interactions in...
G. Carminati, M. Bazzotti, A. Margiotta, M. Spurio
PE
2006
Springer
114views Optimization» more  PE 2006»
14 years 9 months ago
On the performance of Internet worm scanning strategies
In recent years, fast spreading worms, such as Code Red, Slammer, Blaster and Sasser, have become one of the major threats to the security of the Internet. In order to defend agai...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong
IJSN
2007
73views more  IJSN 2007»
14 years 9 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
78
Voted
TSP
2008
90views more  TSP 2008»
14 years 9 months ago
Generalized Correlation Decomposition-Based Blind Channel Estimation in DS-CDMA Systems With Unknown Wide-Sense Stationary Noise
A new blind subspace-based channel estimation technique is proposed for direct-sequence code-division multiple access (DS-CDMA) systems operating in the presence of unknown wide-se...
Keyvan Zarifi, Alex B. Gershman