Sciweavers

1414 search results - page 19 / 283
» Cover Time and Broadcast Time
Sort
View
ICC
2007
IEEE
115views Communications» more  ICC 2007»
14 years 4 months ago
Space-Time Coded Cooperative Multicasting with Maximal Ratio Combining and Incremental Redundancy
Abstract— The performance of wireless multicasting is negatively affected by multipath fading. To improve reliability, cooperation among the nodes of the network can be used to c...
Aitor del Coso, Osvaldo Simeone, Yeheskel Bar-Ness...
CISS
2007
IEEE
14 years 1 months ago
Power-Efficient Relay Selection for Decentralized Distributed Space-Time Block Coding
Distributed space-time-block-coding (Dis-STBC) achieves diversity through cooperative transmission among geographically dispersed nodes. In this paper, we present a powerefficient...
Lu Zhang 0005, Lin Dai, Leonard J. Cimini Jr.
SWAT
2004
Springer
78views Algorithms» more  SWAT 2004»
14 years 3 months ago
Online Maintenance of k-Medians and k-Covers on a Line
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
BIRTHDAY
2009
Springer
14 years 4 months ago
Covering a Tree by a Forest
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
Fanica Gavril, Alon Itai
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
14 years 1 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj