Sciweavers

6365 search results - page 69 / 1273
» Fast Local Computation Algorithms
Sort
View
CEC
2007
IEEE
15 years 7 months ago
Opposition-based particle swarm algorithm with cauchy mutation
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
Hui Wang, Hui Li, Yong Liu, Changhe Li, Sanyou Y. ...
102
Voted
AINA
2003
IEEE
15 years 5 months ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin
95
Voted
ICPR
2008
IEEE
15 years 7 months ago
Invariant visual patterns for video copy detection
Large scale video copy detection task requires compact feature insensitive to various copy changes. Based on local feature trajectory behavior we discover invariant visual pattern...
Xiao Wu, Yongdong Zhang, Yufeng Wu, Junbo Guo, Jin...
93
Voted
ICIP
2001
IEEE
16 years 2 months ago
Fast computation of morphological area pattern spectra
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
Arnold Meijster, Michael H. F. Wilkinson
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 1 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....