Sciweavers

1511 search results - page 29 / 303
» Randomness, lowness and degrees
Sort
View
INFOCOM
2007
IEEE
16 years 11 days ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
SIAMDM
2010
110views more  SIAMDM 2010»
15 years 24 days ago
Embedding Spanning Trees in Random Graphs
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
Michael Krivelevich
FGCN
2008
IEEE
116views Communications» more  FGCN 2008»
16 years 16 days ago
Routing in Degree-Constrained FSO Mesh Networks
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
Ziping Hu, Pramode K. Verma, James J. Sluss Jr.
AVI
2006
15 years 7 months ago
Navigation in degree of interest trees
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
Raluca Budiu, Peter Pirolli, Michael Fleetwood
INFOCOM
2008
IEEE
16 years 14 days ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov