A trade-off between sample complexity and computational complexity in learning Boolean networks from time-series data.
about
Pooled screening for synergistic interactions subject to blocking and noiseComputational and statistical tradeoffs via convex relaxation.Process-driven inference of biological network structure: feasibility, minimality, and multiplicityOn the Sample Complexity of Cancer Pathways Identification.Robust dynamics in minimal hybrid models of genetic networks.
P2860
A trade-off between sample complexity and computational complexity in learning Boolean networks from time-series data.
description
2010 nî lūn-bûn
@nan
2010 թուականի Յունուարին հրատարակուած գիտական յօդուած
@hyw
2010 թվականի հունվարին հրատարակված գիտական հոդված
@hy
2010年の論文
@ja
2010年論文
@yue
2010年論文
@zh-hant
2010年論文
@zh-hk
2010年論文
@zh-mo
2010年論文
@zh-tw
2010年论文
@wuu
name
A trade-off between sample com ...... etworks from time-series data.
@ast
A trade-off between sample com ...... etworks from time-series data.
@en
A trade-off between sample com ...... etworks from time-series data.
@nl
type
label
A trade-off between sample com ...... etworks from time-series data.
@ast
A trade-off between sample com ...... etworks from time-series data.
@en
A trade-off between sample com ...... etworks from time-series data.
@nl
prefLabel
A trade-off between sample com ...... etworks from time-series data.
@ast
A trade-off between sample com ...... etworks from time-series data.
@en
A trade-off between sample com ...... etworks from time-series data.
@nl
P356
P1476
A trade-off between sample com ...... etworks from time-series data.
@en
P2093
Michael T Hallett
P304
P356
10.1109/TCBB.2008.38
P577
2010-01-01T00:00:00Z