2434 search results - page 217 / 487 » Algorithmic Randomness of Closed Sets |
154
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
127
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
136
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
153
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Cellular networks are in a major transition from a carefully planned set of large tower-mounted basestations (BSs) to an irregular deployment of heterogeneous infrastructure eleme...
164
click to vote
SAGA
2007
Springer
15 years 10 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...