Sciweavers

1149 search results - page 145 / 230
» Comparing parameter tuning methods for evolutionary algorith...
Sort
View
CVPR
2008
IEEE
16 years 5 months ago
Granularity and elasticity adaptation in visual tracking
The observation models in tracking algorithms are critical to both tracking performance and applicable scenarios but are often simplified to focus on fixed level of certain target...
Ming Yang, Ying Wu
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 6 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
DAGM
2011
Springer
14 years 2 months ago
Using Landmarks as a Deformation Prior for Hybrid Image Registration
Hybrid registration schemes are a powerful alternative to fully automatic registration algorithms. Current methods for hybrid registration either include the landmark information a...
Marcel Lüthi, Christoph Jud, Thomas Vetter
GPEM
2002
163views more  GPEM 2002»
15 years 2 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
RECOMB
2006
Springer
16 years 3 months ago
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...