13214 search results - page 136 / 2643 » Pseudorandomness for network algorithms |
177
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
185
click to vote
EWSN
2010
Springer
15 years 11 months ago
2010
Springer
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
187
click to vote
RTSS
2005
IEEE
16 years 1 days ago
2005
IEEE
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
213
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
196
click to vote
ICC
2007
IEEE
16 years 23 days ago
2007
IEEE
— A crucial problem in ad hoc networks is finding an efficient and correct route between a source and a destination; however for many networks, a more important problem is prov...