Sciweavers

1020 search results - page 29 / 204
» Efficiency of Search Methods in Dynamic Wireless Networks
Sort
View
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
WMI
2001
114views more  WMI 2001»
13 years 9 months ago
A high capacity multihop packet CDMA wireless network
: An adhoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administra...
Ali Nabi Zadeh, Bijan Jabbari
ICC
2007
IEEE
160views Communications» more  ICC 2007»
14 years 2 months ago
Efficient Coverage Planning for Grid-Based Wireless Sensor Networks
- In this paper we study efficient triangular grid-based sensor deployment planning for coverage when sensor placements are perturbed by random errors around their corresponding gr...
Glen Takahara, Kenan Xu, Hossam S. Hassanein
ICANN
2007
Springer
13 years 11 months ago
An Efficient Search Strategy for Feature Selection Using Chow-Liu Trees
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
AAAI
2004
13 years 9 months ago
High-Level Goal Recognition in a Wireless LAN
Plan recognition has traditionally been developed for logically encoded application domains with a focus on logical reasoning. In this paper, we present an integrated plan-recogni...
Jie Yin, Xiaoyong Chai, Qiang Yang