Sciweavers

247 search results - page 9 / 50
» On Finding Large Conjunctive Clusters
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 9 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
TEC
2010
126views more  TEC 2010»
13 years 2 months ago
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
Mohamed Qasem, Adam Prügel-Bennett
CVPR
2003
IEEE
14 years 9 months ago
Finding and Tracking People from the Bottom Up
We describe a tracker that can track moving people in long sequences without manual initialization. Moving people are modeled with the assumption that, while configuration can var...
Deva Ramanan, David A. Forsyth
BMCBI
2005
122views more  BMCBI 2005»
13 years 7 months ago
GenClust: A genetic algorithm for clustering gene expression data
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...
Vito Di Gesù, Raffaele Giancarlo, Giosu&egr...