Sciweavers

10414 search results - page 129 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
DMIN
2007
214views Data Mining» more  DMIN 2007»
15 years 7 months ago
A Fast KNN Algorithm Based on Simulated Annealing
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
Chuanyao Yang, Yuqin Li, Chenghong Zhang, Yunfa Hu
ISMB
1996
15 years 7 months ago
A Grammar-Based Unification of Several Alignment and Folding Algorithms
Weshowin this paper that manypopular models of folding and/or alignment maybe described by a new formalism: multi-tape S-attribute grammars(MTSAG's).This formalism relieves t...
Fabrice Lefebvre
ISCI
2006
167views more  ISCI 2006»
15 years 6 months ago
Efficient unbalanced merge-sort
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
Enrico Nardelli, Guido Proietti
FLAIRS
2008
15 years 8 months ago
One-Pass Learning Algorithm for Fast Recovery of Bayesian Network
An efficient framework is proposed for the fast recovery of Bayesian network classifier. A novel algorithm, called Iterative Parent-Child learningBayesian Network Classifier (IPC-...
Shunkai Fu, Michel Desmarais, Fan Li
AAAI
2010
15 years 7 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa