Sciweavers

740 search results - page 136 / 148
» An approximation ratio for biclustering
Sort
View
93
Voted
ICC
2008
IEEE
125views Communications» more  ICC 2008»
15 years 6 months ago
Iteratively Detected Sphere Packing Modulated OFDM: An Exit Chart Perspective
- A novel iteratively detected Sphere Packing (SP) modulation aided Orthogonal Frequency Division Multiplexing (OFDM) scheme is proposed, which we refer to as the SPOFDM arrangemen...
Lei Xu, Mohammed El-Hajjar, Osamah Alamri, Sheng C...
IPPS
2008
IEEE
15 years 6 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
98
Voted
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 5 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
EWSN
2004
Springer
15 years 5 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 5 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky