Sciweavers

321 search results - page 53 / 65
» Approximate Models for General Cache Networks
Sort
View
DCOSS
2008
Springer
13 years 10 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
QUESTA
2010
131views more  QUESTA 2010»
13 years 6 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
13 years 9 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
AVSS
2008
IEEE
14 years 2 months ago
Person Tracking with Audio-Visual Cues Using the Iterative Decoding Framework
Tracking humans in an indoor environment is an essential part of surveillance systems. Vision based and microphone array based trackers have been extensively researched in the pas...
Shankar T. Shivappa, Mohan M. Trivedi, Bhaskar D. ...
NIPS
2007
13 years 10 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer