Sciweavers

10412 search results - page 510 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
OPODIS
2001
15 years 8 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
PRL
2008
135views more  PRL 2008»
15 years 6 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
IAJIT
2010
115views more  IAJIT 2010»
15 years 5 months ago
An Enhancement of Major Sorting Algorithms
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
Jehad Alnihoud, Rami Mansi
IAJIT
2010
179views more  IAJIT 2010»
15 years 5 months ago
Enhanced Quicksort Algorithm
: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of res...
Rami Mansi
MICCAI
2007
Springer
16 years 7 months ago
Non-parametric Diffeomorphic Image Registration with the Demons Algorithm
Abstract. We propose a non-parametric diffeomorphic image registration algorithm based on Thirion's demons algorithm. The demons algorithm can be seen as an optimization proce...
Tom Vercauteren, Xavier Pennec, Aymeric Perchant, ...