Sciweavers

247 search results - page 21 / 50
» Incremental String Comparison
Sort
View
MCS
2004
Springer
15 years 2 months ago
A Comparison of Ensemble Creation Techniques
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
SPAA
2010
ACM
14 years 8 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
ICASSP
2011
IEEE
14 years 1 months ago
Performance limits of LMS-based adaptive networks
In this work we analyze the mean-square performance of different strategies for adaptation over two-node least-mean-squares (LMS) networks. The results highlight some interesting ...
Xiaochuan Zhao, Ali H. Sayed
66
Voted
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
14 years 9 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
BMCBI
2010
98views more  BMCBI 2010»
14 years 9 months ago
An optimized TOPS+ comparison method for enhanced TOPS models
nd: Although methods based on highly abstract descriptions of protein structures, such as VAST and TOPS, can perform very fast protein structure comparison, the results can lack a...
Mallika Veeramalai, David Gilbert, Gabriel Valient...