Sciweavers

1541 search results - page 225 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
NIPS
1996
13 years 9 months ago
Combinations of Weak Classifiers
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
Chuanyi Ji, Sheng Ma
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
13 years 9 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff
HIS
2009
13 years 5 months ago
On Some Properties of the lbest Topology in Particle Swarm Optimization
: Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...
PODC
2011
ACM
12 years 11 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICIP
2008
IEEE
14 years 10 months ago
Efficient BP stereo with automatic paramemeter estimation
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
Shafik Huq, Andreas Koschan, Besma R. Abidi, Mongi...