Sciweavers

3894 search results - page 5 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
116
Voted
BMCBI
2006
202views more  BMCBI 2006»
14 years 9 months ago
Integrated biclustering of heterogeneous genome-wide datasets for the inference of global regulatory networks
Background: The learning of global genetic regulatory networks from expression data is a severely under-constrained problem that is aided by reducing the dimensionality of the sea...
David J. Reiss, Nitin S. Baliga, Richard Bonneau
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 12 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
12 years 12 months ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...
ICA
2012
Springer
13 years 5 months ago
New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
Sylvain Le Corff, Gersende Fort, Eric Moulines
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
12 years 12 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...