Sciweavers

867 search results - page 16 / 174
» Network Robustness and Graph Topology
Sort
View
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet
ISCC
2005
IEEE
14 years 1 months ago
Hierarchical Peer-to-Peer Networks Using Lightweight SuperPeer Topologies
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
SASO
2008
IEEE
14 years 2 months ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal
KIVS
2005
Springer
14 years 1 months ago
A Case for Lightweight SuperPeer Topologies
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou