Sciweavers

364 search results - page 23 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
ICRA
2009
IEEE
185views Robotics» more  ICRA 2009»
15 years 6 months ago
Ad-hoc wireless network coverage with networked robots that cannot localize
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
127
Voted
EUROPAR
2009
Springer
14 years 9 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
16 years 28 days ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial
GRAPHICSINTERFACE
2001
15 years 1 months ago
Corrosion: Simulating and Rendering
Weathering phenomena represent a topic of growing interest in computer graphics, and corrosion reactions are of great importance since they affect a large number of different fiel...
Stéphane Mérillou, Jean-Michel Disch...
SIAMSC
2008
132views more  SIAMSC 2008»
14 years 11 months ago
Stochastic Preconditioning for Diagonally Dominant Matrices
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
Haifeng Qian, Sachin S. Sapatnekar