Sciweavers

1169 search results - page 104 / 234
» Comparing performance of algorithms for generating concept l...
Sort
View
RECOMB
2004
Springer
14 years 9 months ago
Multiple Genome Alignment by Clustering Pairwise Matches
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
Jeong-Hyeon Choi, Kwangmin Choi, Hwan-Gue Cho, Sun...
MCS
2010
Springer
14 years 2 months ago
Online Non-stationary Boosting
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
ICTAI
2003
IEEE
14 years 2 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
GIS
2008
ACM
14 years 10 months ago
Autonomous navigation of mobile agents using RFID-enabled space partitions
Existing techniques for autonomous indoor navigation are often environment-specific and thus limited in terms of their applicability. In this paper, we take a fundamentally differ...
Muhammad Atif Mehmood, Lars Kulik, Egemen Tanin
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 9 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet