1369 search results - page 178 / 274 » Lattice computations for random numbers |
COLT
2008
Springer
13 years 11 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
BMCBI
2004
13 years 9 months ago
2004
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
BMCBI
2008
13 years 9 months ago
2008
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...