Sciweavers

11371 search results - page 169 / 2275
» The network inhibition problem
Sort
View
CISS
2007
IEEE
16 years 28 days ago
Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks
—We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection und...
Tong Zhao, Qing Zhao
ICB
2009
Springer
142views Biometrics» more  ICB 2009»
15 years 11 months ago
A Random Network Ensemble for Face Recognition
In this paper, we propose a random network ensemble for face recognition problem, particularly for images with a large appearance variation and with a limited number of training se...
Kwontaeg Choi, Kar-Ann Toh, Hyeran Byun
NN
2008
Springer
15 years 6 months ago
Two k-winners-take-all networks with discontinuous activation functions
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...
Qingshan Liu, Jun Wang
GLOBECOM
2010
IEEE
15 years 4 months ago
Sliding Mode Based Joint Congestion Control and Scheduling in Multi-Hop Ad Hoc Networks with Multi-Class Services
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
Zongrui Ding, Dapeng Wu
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...