13214 search results - page 45 / 2643 » Pseudorandomness for network algorithms |
175
click to vote
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
170
click to vote
FCSC
2007
15 years 5 months ago
2007
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent years. One category of algorithms for detecting community struct...
181
click to vote
PKDD
2007
Springer
16 years 4 days ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
181
click to vote
ICC
2007
IEEE
16 years 10 days ago
2007
IEEE
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
173
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop distributed algorithms for self-organizing sensor networks that respond to directing a target through a region. The sensor network models the danger levels sensed acros...