Sciweavers

1291 search results - page 140 / 259
» Optimally switched linear systems
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 8 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
GLOBECOM
2007
IEEE
14 years 2 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
NETWORKING
2000
13 years 9 months ago
Sensitivity of ABR Congestion Control Algorithms to Hurst Parameter Estimates
Optimal linear predictors can be utilised in ABR control algorithms for the management of self-similar network traffic. However, estimates of the Hurst parameter are required to ge...
Sven A. M. Östring, Harsha Sirisena, Irene Hu...
TSP
2010
13 years 2 months ago
Reduced feedback schemes using random beamforming in MIMO broadcast channels
A random beamforming scheme for the Gaussian MIMO broadcast channel with channel quality feedback is investigated and extended. Considering the case where the receivers each have r...
Matthew Pugh, Bhaskar D. Rao
CVPR
2000
IEEE
14 years 10 months ago
Impact of Dynamic Model Learning on Classification of Human Motion
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. However, most work on tracking and analysis of figure motion has employed eith...
Vladimir Pavlovic, James M. Rehg