Sciweavers

532 search results - page 37 / 107
» Think globally, search locally
Sort
View
ANOR
2007
166views more  ANOR 2007»
14 years 9 months ago
Memetic particle swarm optimization
Abstract We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in a...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
GECCO
2004
Springer
15 years 3 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ICIP
2007
IEEE
15 years 11 months ago
Query-Driven Locally Adaptive Fisher Faces and Expert-Model for Face Recognition
We present a novel expert-model of Query-Driven Locally Adaptive (QDLA) Fisher faces for robust face recognition. For each query face, the proposed method first fits local Fisher ...
Yun Fu, Junsong Yuan, Zhu Li, Thomas S. Huang, Yin...
IPCCC
2007
IEEE
15 years 4 months ago
Understanding Localized-Scanning Worms
— Localized scanning is a simple technique used by attackers to search for vulnerable hosts. Localized scanning trades off between the local and the global search of vulnerable h...
Zesheng Chen, Chao Chen, Chuanyi Ji
PAMI
2006
156views more  PAMI 2006»
14 years 9 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann