5606 search results - page 178 / 1122 » Randomization Techniques for Graphs. |
136
click to vote
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
110
Voted
ICNP
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
112
Voted
WCNC
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
100
Voted
MONET
2006
15 years 19 days ago
2006
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
120
click to vote
SLSFS
2005
Springer
15 years 6 months ago
2005
Springer
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...