1149 search results - page 210 / 230 » Minimally non-Pfaffian graphs |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
DAM
2008
13 years 7 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
AUTOMATICA
2006
13 years 7 months ago
2006
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...