253 search results - page 28 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
102
click to vote
CIVR
2010
Springer
15 years 2 months ago
2010
Springer
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
COCO
2007
Springer
15 years 6 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
101
click to vote
PERCOM
2005
ACM
15 years 11 months ago
2005
ACM
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
EJC
2006
14 years 11 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
130
click to vote
COMBINATORICS
2006
14 years 11 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...