Sciweavers

592 search results - page 90 / 119
» Crossing numbers of random graphs
Sort
View
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 8 months ago
Statistical properties of subgroups of free groups
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...
Frédérique Bassino, Armando Martino,...
ICPADS
2005
IEEE
14 years 1 months ago
On the Connectedness of Peer-to-Peer Overlay Networks
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
Weisheng Si, MingChu Li
GLOBECOM
2007
IEEE
14 years 2 months ago
On the (in)Effectiveness of Probabilistic Marking for IP Traceback Under DDoS Attacks
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
Vamsi Paruchuri, Arjan Durresi, Raj Jain
PODC
2011
ACM
12 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICC
2007
IEEE
14 years 2 months ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...