415 search results - page 71 / 83 » Optimal query complexity bounds for finding graphs |
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
DATAMINE
2010
13 years 7 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
CDES
2008
13 years 9 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
IJRR
2010
13 years 5 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...