492 search results - page 78 / 99 » The number of possibilities for random dating |
134
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete inte...
153
click to vote
IANDC
2010
15 years 4 months ago
2010
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit de...
173
click to vote
SPAA
2006
ACM
16 years 1 days ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
180
click to vote
FOCS
2008
IEEE
16 years 17 days ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
156
click to vote
FOCS
2007
IEEE
16 years 13 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...