313 search results - page 53 / 63 » Shortest Paths in Distance-regular Graphs |
JMLR
2012
11 years 10 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
OPODIS
2008
13 years 9 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
TIP
1998
13 years 7 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
ALGOSENSORS
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
SIAMDM
2010
13 years 5 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...