492 search results - page 11 / 99 » The number of possibilities for random dating |
BMCBI
2006
13 years 8 months ago
2006
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
BMCBI
2006
13 years 8 months ago
2006
Background: One-dimensional protein structures such as secondary structures or contact numbers are useful for three-dimensional structure prediction and helpful for intuitive unde...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel ...
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...