Sciweavers

9949 search results - page 130 / 1990
» On the Network Complexity of Selection
Sort
View
COMSWARE
2006
IEEE
15 years 10 months ago
Spread-based heuristic for sensor selection in sensor networks
In this paper we propose a method for selecting an appropriate subset of sensors with a view to minimize estimation error while tracking a target with sensors spread across in a 2...
Vaishali P. Sadaphal, Bijendra N. Jain
WICON
2008
15 years 5 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
GLOBECOM
2010
IEEE
15 years 1 months ago
Filter-and-Forward Distributed Beamforming for Two-Way Relay Networks with Frequency Selective Channels
Abstract-- A new approach to distributed cooperative beamforming in two-way half-duplex relay networks with frequency selective channels is proposed. In our scheme, two transceiver...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
DASFAA
2006
IEEE
220views Database» more  DASFAA 2006»
15 years 10 months ago
KEYNOTE: Keyword Search by Node Selection for Text Retrieval on DHT-Based P2P Networks
Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation ...
Zheng Zhang, Shuigeng Zhou, Weining Qian, Aoying Z...
JSAC
2007
56views more  JSAC 2007»
15 years 4 months ago
Grouping and partner selection in cooperative wireless networks
— Various results to date have demonstrated the advantages of one or several relay nodes assisting transmissions in a wireless network. In many practical scenarios, not all nodes...
Aria Nosratinia, Todd E. Hunter