Sciweavers

909 search results - page 106 / 182
» On the approximability of some network design problems
Sort
View
JSAC
2007
133views more  JSAC 2007»
15 years 6 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
REALWSN
2010
15 years 1 months ago
Visibility Levels: Managing the Tradeoff between Visibility and Resource Consumption
Pre-deployment tests of sensor networks in indoor testbeds can only deliver a very approximate view of the correctness and performance of a deployed sensor network and it is theref...
Junyan Ma, Kay Römer
NICSO
2010
Springer
16 years 25 days ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 14 days ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
TCSV
2010
15 years 1 months ago
Distributed Media-Aware Rate Allocation for Wireless Video Streaming
This paper addresses the rate allocation problem for wireless video streaming. Results from a simple subjective viewing test indicate that perceptually preferred allocation can be...
Xiaoqing Zhu, Bernd Girod