866 search results - page 123 / 174 » Algorithms for Comparing Pedigree Graphs |
ICNP
2005
IEEE
14 years 2 months ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
SIGCOMM
2004
ACM
14 years 2 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
INFOCOM
1998
IEEE
14 years 1 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
DCOSS
2006
Springer
14 years 26 days ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
AAAI
2007
13 years 11 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...