1591 search results - page 130 / 319 » Random lifts of graphs |
164
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
176
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
184
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
168
click to vote
ICPP
2006
IEEE
16 years 13 days ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
153
click to vote
RSA
2002
15 years 6 months ago
2002
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...