44 search results - page 3 / 9 » On Optimal Node Splitting for R-trees |
CP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
124
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
TON
2008
14 years 9 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
105
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jam...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...