16404 search results - page 3063 / 3281 » A set coverage problem |
141
Voted
BMCBI
2010
15 years 4 months ago
2010
Background: High-throughput DNA methylation arrays are likely to accelerate the pace of methylation biomarker discovery for a wide variety of diseases. A potential problem with a ...
131
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Single nucleotide polymorphisms (SNP) constitute more than 90% of the genetic variation, and hence can account for most trait differences among individuals in a given ...
144
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
136
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
156
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...