Sciweavers

3528 search results - page 319 / 706
» A New Approach to Planning in Networks
Sort
View
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
16 years 7 days ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
IMC
2004
ACM
16 years 6 days ago
Introducing scalability in network measurement: toward 10 Gbps with commodity hardware
The capacity of today's network links, along with the heterogeneity of their traffic, is rapidly growing, more than the workstation’s processing power. This makes the task ...
Loris Degioanni, Gianluca Varenni
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
15 years 11 months ago
Self-securing ad hoc wireless networks
Mobile ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to secur...
Haiyun Luo, Petros Zerfos, Jiejun Kong, Songwu Lu,...
MOBIHOC
2000
ACM
15 years 11 months ago
Role-based multicast in highly mobile but sparsely connected ad hoc networks
— We present an approach to multicasting messages among highly mobile hosts in ad hoc networks. We suggest a new definition of a role-based multicast that suits the special need...
Linda Briesemeister, Günter Hommel
ISPAN
1999
IEEE
15 years 11 months ago
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho