Sciweavers

320 search results - page 45 / 64
» Rigorous Result for the CHKNS Random Graph Model
Sort
View
IMC
2004
ACM
14 years 1 months ago
A pragmatic approach to dealing with high-variability in network measurements
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
Walter Willinger, David Alderson, Lun Li
ICIG
2009
IEEE
13 years 6 months ago
Statistical Modeling of Optical Flow
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
Dongmin Ma, Véronique Prinet, Cyril Cassisa
WOWMOM
2006
ACM
168views Multimedia» more  WOWMOM 2006»
14 years 2 months ago
Modeling Node Compromise Spread in Wireless Sensor Networks Using Epidemic Theory
Motivated by recent surfacing viruses that can spread over the air interfaces, in this paper, we investigate the potential disastrous threat of node compromise spreading in wirele...
Pradip De, Yonghe Liu, Sajal K. Das
PDCAT
2005
Springer
14 years 2 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
14 years 7 days ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...