Sciweavers

4112 search results - page 292 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
CAINE
2009
15 years 4 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...
ICCS
2009
Springer
15 years 4 months ago
Gene Specific Co-regulation Discovery: An Improved Approach
Abstract. Discovering gene co-regulatory relationships is a new but important research problem in DNA microarray data analysis. The problem of gene specific co-regulation discovery...
Ji Zhang, Qing Liu, Kai Xu 0003
CEC
2007
IEEE
15 years 10 months ago
A versatile quantum-inspired evolutionary algorithm
Abstract-- This study points out some weaknesses of existing Quantum-Inspired Evolutionary Algorithms (QEA) and explains in particular how hitchhiking phenomenons can slow down the...
Michael Defoin-Platel, Stefan Schliebs, Nikola Kas...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 6 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov