Sciweavers

139 search results - page 26 / 28
» Bandwidth on AT-Free Graphs
Sort
View
IWCMC
2006
ACM
14 years 3 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
14 years 2 months ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...
CORR
2010
Springer
338views Education» more  CORR 2010»
13 years 9 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
FPL
2010
Springer
108views Hardware» more  FPL 2010»
13 years 7 months ago
FPGA Based Network Traffic Analysis Using Traffic Dispersion Patterns
The problem of Network Traffic Classification (NTC) has attracted significant amount of interest in the research community, offering a wide range of solutions at various levels. Th...
Faisal Khan, Maya Gokhale, Chen-Nee Chuah
PODC
2009
ACM
14 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...