Sciweavers

3136 search results - page 73 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
BMVC
2001
15 years 8 months ago
Comparison of 3D Algorithms for Non-rigid Motion and Correspondence Estimation
We address the problem of non-rigid motion and correspondence estimation in 3D images in the absense of prior domain information. A generic framework is utilized in which a soluti...
Pavel Laskov, Chandra Kambhamettu
JNCA
2008
86views more  JNCA 2008»
15 years 6 months ago
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the ef...
Xiao Qin
ITSL
2008
15 years 7 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
DMIN
2006
126views Data Mining» more  DMIN 2006»
15 years 7 months ago
Comparison and Analysis of Mutation-based Evolutionary Algorithms for ANN Parameters Optimization
Mutation-based Evolutionary Algorithms, also known as Evolutionary Programming (EP) are commonly applied to Artificial Neural Networks (ANN) parameters optimization. This paper pre...
Kristina Davoian, Alexander Reichel, Wolfram-Manfr...
BMCBI
2008
122views more  BMCBI 2008»
15 years 6 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang