Sciweavers

6666 search results - page 409 / 1334
» Reconfigurable Computing for High Performance Networking App...
Sort
View
172
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
PERCOM
2009
ACM
16 years 1 months ago
BitHoc: A content sharing application for Wireless Ad hoc Networks
—As a result of the wide spread of new efficient mobile communication devices, users are more and more willing to find on these devices (PDAs, Smartphones, etc) applications si...
Amir Krifa, Mohamed Karim Sbai, Chadi Barakat, Thi...
ICNC
2005
Springer
16 years 10 days ago
DNA Computing Approach to Construction of Semantic Model
In this paper, after a new DNA-based semantic model is theoretically proposed, the preliminary experiment on construction of the small test model is successfully done. This model, ...
Yusei Tsuboi, Zuwairie Ibrahim, Nobuyuki Kasai, Os...
INFOCOM
2006
IEEE
16 years 26 days ago
Mobile Emulab: A Robotic Wireless and Sensor Network Testbed
Abstract— Simulation has been the dominant research methodology in wireless and sensor networking. When mobility is added, real-world experimentation is especially rare. However,...
David Johnson, Tim Stack, Russ Fish, Daniel Montra...
MOBICOM
2012
ACM
13 years 9 months ago
Energy-based rate adaptation for 802.11n
Rate adaptation (RA) has been used to achieve high goodput. In this work, we explore to use RA for energy efficiency in 802.11n NICs. We show that current MIMO RA algorithms are ...
Chi-Yu Li, Chunyi Peng, Songwu Lu, Xinbing Wang