5606 search results - page 44 / 1122 » Randomization Techniques for Graphs. |
176
click to vote
WEA
2007
Springer
16 years 2 days ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
143
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
173
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
130
click to vote
IPL
2008
15 years 6 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
185
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...