Sciweavers

1563 search results - page 46 / 313
» Performance comparison of memetic algorithms
Sort
View
PAMI
2006
119views more  PAMI 2006»
13 years 8 months ago
Recovering Articulated Pose: A Comparison of Two Pre and Postimposed Constraint Methods
We contrast the performance of two methods of imposing constraints during the tracking of articulated objects, the first method preimposing the kinematic constraints during trackin...
Teófilo Emídio de Campos, Ben Tordof...
ICPR
2008
IEEE
14 years 10 months ago
Circular Earth Mover's Distance for the comparison of local features
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...
Julie Delon, Julien Rabin, Yann Gousseau
ISPDC
2007
IEEE
14 years 3 months ago
A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
Tchimou N'Takpé, Frédéric Sut...
KES
2004
Springer
14 years 2 months ago
A Comparison of Two Approaches to Data Mining from Imbalanced Data
Our objective is a comparison of two data mining approaches to dealing with imbalanced data sets. The first approach is based on saving the original rule set, induced by the LEM2 ...
Jerzy W. Grzymala-Busse, Jerzy Stefanowski, Szymon...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 2 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...