Sciweavers

440 search results - page 16 / 88
» Multiple Comparisons in Induction Algorithms
Sort
View
CORR
2007
Springer
165views Education» more  CORR 2007»
15 years 2 months ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...
ICASSP
2011
IEEE
14 years 6 months ago
A novel fast canonical-signed-digit conversion technique for multiplication
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
Rui Guo, Linda DeBrunner
ISBI
2008
IEEE
16 years 3 months ago
Fast no ground truth image registration accuracy evaluation: Comparison of bootstrap and Hessian approaches
Image registration algorithms provide a displacement field between two images. We consider the problem of estimating accuracy of the calculated displacement field from the input i...
Jan Kybic
106
Voted
CEC
2008
IEEE
15 years 9 months ago
Decentralised distributed multiple objective particle swarm optimisation using peer to peer networks
—This paper describes a distributed particle swarm optimisation algorithm (PSO) based on peer-to-peer computer networks. A number of modifications are made to the more tradition...
Ian Scriven, Andrew Lewis, David Ireland, Junwei L...
DAC
1999
ACM
16 years 3 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...