307 search results - page 59 / 62 » Finite locally-quasiprimitive graphs |
SIROCCO
2008
13 years 11 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
IJSI
2008
13 years 9 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
EJC
2007
13 years 9 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
ECCV
2006
Springer
14 years 11 months ago
2006
Springer
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...