Sciweavers

108 search results - page 13 / 22
» Spreading of Messages in Random Graphs
Sort
View
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 2 months ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
Sérgio Crisóstomo, Udo Schilcher, Ch...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 7 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolution of discrete gene regulatory models
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
Afshin Esmaeili, Christian Jacob
CIC
2006
101views Communications» more  CIC 2006»
13 years 8 months ago
Non Blocking OVSF Codes Influence The Performance Of WCDMA System
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...
Shailendra Mishra, Nipur
WIOPT
2006
IEEE
14 years 1 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi