Sciweavers

182 search results - page 23 / 37
» Approximation algorithms for time-constrained scheduling on ...
Sort
View
JMLR
2010
137views more  JMLR 2010»
13 years 2 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton
INFOCOM
2000
IEEE
14 years 1 days ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
COMCOM
2006
147views more  COMCOM 2006»
13 years 7 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
ICPR
2008
IEEE
14 years 2 months ago
Direct 3-D shape recovery from image sequence based on multi-scale Bayesian network
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...
Norio Tagawa, Junya Kawaguchi, Shoichi Naganuma, K...
INFOCOM
2008
IEEE
14 years 2 months ago
Proportional Fairness in Multi-Rate Wireless LANs
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
Erran L. Li, Martin Pal, Yang Richard Yang