3 search results - page 1 / 1 » Bounded-depth circuits cannot sample good codes |
ECCC
2010
13 years 4 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
BMCBI
2007
13 years 4 months ago
2007
Background: Serial analysis of gene expression (SAGE) is used to obtain quantitative snapshots of the transcriptome. These profiles are count-based and are assumed to follow a Bin...