Sciweavers

9949 search results - page 134 / 1990
» On the Network Complexity of Selection
Sort
View
ITIIS
2010
92views more  ITIIS 2010»
14 years 11 months ago
Performance Analysis of Selection Relaying Schemes over Different Fading Environments in Wireless Networks
In this paper, two selection relaying schemes are proposed and compared with each other in terms of packet error rate (PER) and diversity order. Moreover, the comparison is perfor...
Tran Thi Xuyen, Hyung Yun Kong
IJON
2002
83views more  IJON 2002»
15 years 4 months ago
Modeling temporal combination selective neurons of the songbird
Some neurons in the nucleus HVc of the songbird respond vigorously to sequences of syllables as they appear in the bird's own song (such as AB), but they respond weakly or no...
Patrick J. Drew, L. F. Abbott
IROS
2009
IEEE
164views Robotics» more  IROS 2009»
15 years 11 months ago
Complex networks of simple neurons for bipedal locomotion
— Fluid bipedal locomotion remains a significant challenge for humanoid robotics. Recent bio-inspired approaches have made significant progress by using small numbers of tightl...
Brian F. Allen, Petros Faloutsos
INFOCOM
2007
IEEE
15 years 10 months ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
IJCNN
2006
IEEE
15 years 10 months ago
Nonlinear principal component analysis of noisy data
With very noisy data, having plentiful samples eliminates overfitting in nonlinear regression, but not in nonlinear principal component analysis (NLPCA). To overcome this problem...
William W. Hsieh