Sciweavers

2571 search results - page 374 / 515
» Approximation schemes for wireless networks
Sort
View
ICML
2008
IEEE
16 years 7 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
SECON
2007
IEEE
16 years 23 days ago
Distinguishing Data Transience from False Injection in Sensor Networks
— Wireless sensor networks are increasingly being employed for potentially hazardous and critical applications such as monitoring the gas concentration levels in a battle field....
Vinod Shukla, Daji Qiao
COMCOM
2010
118views more  COMCOM 2010»
15 years 3 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
CISS
2008
IEEE
16 years 29 days ago
Optimization via communication networks
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
Matthew Andrews
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
The Networked Common Goods Game
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
Jinsong Tan