Sciweavers

239 search results - page 14 / 48
» Random walks in a supply network
Sort
View
ICASSP
2011
IEEE
13 years 5 days ago
On the success of network inference using a markov routing model
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
Laura Balzano, Robert Nowak, Matthew Roughan
KDD
2007
ACM
143views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining Research Communities in Bibliographical Data
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
Osmar R. Zaïane, Jiyang Chen, Randy Goebel
BERTINORO
2005
Springer
14 years 2 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
TRIDENTCOM
2006
IEEE
14 years 2 months ago
Description of an IPv6 Linux-based UTRAN testbed
— Network modelling and traffic characterisation are essential research activities towards the optimisation of UMTS. We present here our IPv6 Linux-based UTRAN testbed which aim...
Hugues van Peteghem, Laurent Schumacher
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
14 years 2 months ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...