1949 search results - page 217 / 390 » Random graphs on surfaces |
144
click to vote
UAI
2003
15 years 6 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
127
click to vote
JPDC
2008
15 years 5 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
137
click to vote
CORR
2010
Springer
15 years 3 days ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
142
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
145
click to vote
COMSWARE
2007
IEEE
15 years 11 months ago
2007
IEEE
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...