Sciweavers

641 search results - page 82 / 129
» On robust online scheduling algorithms
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
TSMC
2008
147views more  TSMC 2008»
13 years 7 months ago
Tracking of Multiple Targets Using Online Learning for Reference Model Adaptation
Recently, much work has been done in multiple ob-4 ject tracking on the one hand and on reference model adaptation5 for a single-object tracker on the other side. In this paper, we...
Franz Pernkopf
CVPR
2009
IEEE
15 years 3 months ago
Learning to Track with Multiple Observers
We propose a novel approach to designing algorithms for object tracking based on fusing multiple observation models. As the space of possible observation models is too large for...
Björn Stenger, Roberto Cipolla, Thomas Woodle...
JMLR
2006
131views more  JMLR 2006»
13 years 8 months ago
Incremental Support Vector Learning: Analysis, Implementation and Applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM ...
Pavel Laskov, Christian Gehl, Stefan Krüger, ...
COMCOM
2006
150views more  COMCOM 2006»
13 years 8 months ago
Adaptive ad hoc self-organizing scheduling for quasi-periodic sensor network lifetime
Wireless sensor networks are poised to revolutionize our abilities in sensing and controlling our environment. Power conservation is a primary research concern for these networks....
Sharat C. Visweswara, Rudra Dutta, Mihail L. Sichi...