Sciweavers

54 search results - page 9 / 11
» Network Coding for Computing: Cut-Set Bounds
Sort
View
PDP
2005
IEEE
14 years 16 days ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
WIOPT
2005
IEEE
14 years 16 days ago
A New Relaying Scheme for Cheap Wireless Relay Nodes
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
Ramin Khalili, Kavé Salamatian
IWCMC
2009
ACM
14 years 1 months ago
Multiple-antenna multiple-relay system with precoding for multiuser transmission
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
Arash Talebi, Witold A. Krzymien
EWSN
2010
Springer
14 years 2 days ago
Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
Tobias Baumgartner, Ioannis Chatzigiannakis, S&aac...
EMSOFT
2009
Springer
13 years 10 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond