O (log N / log log N) Randomized Routing in Degree-log N "Hypermeshes".

Ted H. Szymanski

Published in: ICPP (1) (1991)

Keyphrases

lower bound
worst case
log log
data sets
response time
knowledge base
information systems
image processing
website
web services
case study
multiscale
cooperative
probabilistic model
computer vision
artificial intelligence
shortest path
real time