5138 search results - page 768 / 1028 » Randomized Algorithms for 3-SAT |
167
click to vote
NIPS
2007
15 years 8 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
168
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
170
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
132
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Experimental examinations of biofluids to measure concentrations of proteins or their fragments or metabolites are being explored as a means of early disease detection...
212
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Independently derived expression profiles of the same biological condition often have few genes in common. In this study, we created populations of expression profiles...