1369 search results - page 178 / 274 » Lattice computations for random numbers |
193
Voted
COLT
2008
Springer
15 years 7 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...
198
click to vote
BMCBI
2004
15 years 5 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...
194
click to vote
CORR
2011
Springer
15 years 19 days 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...
167
click to vote
STACS
2009
Springer
16 years 12 days 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...
171
click to vote
BMCBI
2008
15 years 5 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...