745 search results - page 63 / 149 » On Generating Random Network Structures: Connected Graphs |
118
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
127
click to vote
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
105
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Deep Belief Networks (DBNs) are hierarchical generative models which have been used successfully to model high dimensional visual data. However, they are not robust to common vari...
ASUNAM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
108
Voted
NETWORKING
2007
15 years 2 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...