Sciweavers

7522 search results - page 279 / 1505
» Spacing memetic algorithms
Sort
View
PAMI
2008
215views more  PAMI 2008»
15 years 6 months ago
Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-co...
Brent C. Munsell, Pahal Dalal, Song Wang
CF
2009
ACM
16 years 1 months ago
Space-and-time efficient garbage collectors for parallel systems
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Shaoshan Liu, Ligang Wang, Xiao-Feng Li, Jean-Luc ...
CVPR
2012
IEEE
13 years 9 months ago
Improving multi-target tracking via social grouping
We address the problem of multi-person dataassociation-based tracking (DAT) in semi-crowded environments from a single camera. Existing trackletassociation-based methods using pur...
Zhen Qin, Christian R. Shelton
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 11 months ago
Benchmarking the NEWUOA on the BBOB-2009 noisy testbed
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
Raymond Ros
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 11 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman