Sciweavers

13214 search results - page 91 / 2643
» Pseudorandomness for network algorithms
Sort
View
IJBRA
2010
134views more  IJBRA 2010»
15 years 4 months ago
Deterministic graph-theoretic algorithm for detecting modules in biological interaction networks
—Accumulating evidence suggests that biological systems exhibit modular organization. Accurate identification of modularity is vital for understanding this organization. A recen...
Roger L. Chang, Feng Luo, Stuart Johnson, Richard ...
ANCS
2008
ACM
15 years 8 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
ADHOC
2006
116views more  ADHOC 2006»
15 years 6 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
ICPP
2006
IEEE
16 years 12 days ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
MOBICOM
2006
ACM
16 years 10 days ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz