Sciweavers

641 search results - page 44 / 129
» On robust online scheduling algorithms
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
ICC
2008
IEEE
162views Communications» more  ICC 2008»
14 years 2 months ago
Distributed Opportunistic Scheduling in Multihop Wireless Ad Hoc Networks
Abstract—In this paper, we introduce a framework for distributed opportunistic scheduling in multihop wireless ad hoc networks. With the proposed framework, one can take a schedu...
Yijiang Sun, Victor O. K. Li, Ka-Cheong Leung
CVPR
2000
IEEE
14 years 10 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
ICASSP
2008
IEEE
14 years 2 months ago
Low-rank covariance matrix tapering for robust adaptive beamforming
Covariance matrix tapering (CMT) is a popular approach to improve the robustness of adaptive beamformers against moving or wideband interferers. In this paper, we develop a comput...
Michael Rübsamen, Christian Gerlach, Alex B. ...
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 2 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs