Sciweavers

5114 search results - page 301 / 1023
» Complex networks
Sort
View
105
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Towards improving network flow watermarks using the repeat-accumulate codes
Network intruders try to hide their identity by relaying their traf c through a number of intermediate hosts, called stepping stones. Network ow watermarks have been used to detec...
Amir Houmansadr, Nikita Borisov
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 7 months ago
Robustness and modular structure in networks
Many complex systems, from power grids and the internet, to the brain and society, can be modeled using modular networks. Modules, densely interconnected groups of elements, often...
James P. Bagrow, Sune Lehmann, Yong-Yeol Ahn
DSN
2002
IEEE
15 years 8 months ago
Evaluation of the Maximum Level Reached by a Queue Over a Finite Period
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
Gerardo Rubino
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
15 years 9 months ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski
WWW
2010
ACM
15 years 10 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf