Sciweavers

1949 search results - page 187 / 390
» Random graphs on surfaces
Sort
View
IMC
2010
ACM
15 years 2 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
ICML
2008
IEEE
16 years 5 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
SPRINGSIM
2010
15 years 3 months ago
Using factored bond graphs for distributed diagnosis of physical systems
This paper presents a distributed Bayesian fault diagnosis scheme for physical systems. Our diagnoser design is based on a procedure for factoring the global system bond graph (BG...
Indranil Roychoudhury, Gautam Biswas, Xenofon D. K...
CIARP
2009
Springer
15 years 2 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
EWSN
2010
Springer
16 years 2 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth