313 search results - page 44 / 63 » Shortest Paths in Distance-regular Graphs |
100
click to vote
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
137
click to vote
PODC
2006
ACM
15 years 6 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
96
Voted
PVLDB
2010
14 years 11 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
233
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
119
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...