192 search results - page 26 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
COMGEO
2012
ACM
12 years 4 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
JC
2007
13 years 8 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
COLT
2000
Springer
14 years 29 days ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...