Sciweavers

2229 search results - page 29 / 446
» Comparative analysis of biclustering algorithms
Sort
View
EMO
2005
Springer
175views Optimization» more  EMO 2005»
14 years 1 months ago
A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
R. Lyndon While
PR
2008
129views more  PR 2008»
13 years 7 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
ICASSP
2011
IEEE
12 years 11 months ago
Steady-state analysis of the NLMS algorithm with reusing coefficient vector and a method for improving its performance
The reuse of past coefficient vectors of the NLMS for reducing the steady-state MSD in a low signal-to-noise ratio (SNR) was proposed recently. Its convergence analysis has not b...
Seong-Eun Kim, Jae-Woo Lee, Woo-Jin Song
LADC
2011
Springer
12 years 10 months ago
Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
—We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
Fatemeh Borran, Martin Hutle, André Schiper
SIGCOMM
1989
ACM
13 years 11 months ago
Analysis and Simulation of a Fair Queueing Algorithm
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is propos...
Alan J. Demers, Srinivasan Keshav, Scott Shenker