Sciweavers

927 search results - page 103 / 186
» Algorithms for Finding Gene Clusters
Sort
View
UAI
2008
15 years 7 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
CEC
2007
IEEE
16 years 16 days ago
A co-evolutionary framework for regulatory motif discovery
Abstract— In previous work, we have shown how an evolutionary algorithm with a clustered population can be used to concurrently discover multiple regulatory motifs present within...
Michael A. Lones, Andy M. Tyrrell
SCIA
2005
Springer
166views Image Analysis» more  SCIA 2005»
15 years 11 months ago
Clustering Based on Principal Curve
Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clusteri...
Ioan Cleju, Pasi Fränti, Xiaolin Wu
EACL
2009
ACL Anthology
15 years 4 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
BMCBI
2008
158views more  BMCBI 2008»
15 years 6 months ago
Analyzing M-CSF dependent monocyte/macrophage differentiation: Expression modes and meta-modes derived from an independent compo
Background: The analysis of high-throughput gene expression data sets derived from microarray experiments still is a field of extensive investigation. Although new approaches and ...
Dominik Lutter, Peter Ugocsai, Margot Grandl, Evel...