Sciweavers

247 search results - page 17 / 50
» Scaling up all pairs similarity search
Sort
View
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 16 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ICPADS
2005
IEEE
14 years 1 months ago
PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
Cristian Coarfa, Yuri Dotsenko, John M. Mellor-Cru...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 15 days ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
CVPR
2010
IEEE
14 years 1 months ago
Line Matching Leveraged By Point Correspondences
A novel method for line matching is proposed. The basic idea is to use tentative point correspondences, which can be easily obtained by keypoint matching methods, to significantly...
Bin Fan, Fuchao Wu, Zhanyi Hu