Sciweavers

37 search results - page 3 / 8
» Epipolar Spaces and Optimal Sampling Strategies
Sort
View
IJSN
2007
73views more  IJSN 2007»
13 years 7 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
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
13 years 11 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ECCV
2002
Springer
14 years 8 months ago
Hyperdynamics Importance Sampling
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
Cristian Sminchisescu, Bill Triggs
EVOW
2009
Springer
14 years 1 months ago
Evolutionary Optimization Guided by Entropy-Based Discretization
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good resu...
Guleng Sheri, David W. Corne
SAC
2006
ACM
14 years 29 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal