5606 search results - page 442 / 1122 » Randomization Techniques for Graphs. |
179
click to vote
MSWIM
2004
ACM
16 years 5 days ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
208
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
184
click to vote
ESA
1997
Springer
15 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
145
click to vote
TIT
2008
15 years 6 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...