Sciweavers

107 search results - page 14 / 22
» Polynomially Bounded Matrix Interpretations
Sort
View
TSP
2008
115views more  TSP 2008»
13 years 6 months ago
Robustness of Adaptive Narrowband Beamforming With Respect to Bandwidth
Abstract--This paper addresses the robustness of adaptive narrowband beamforming with respect to bandwidth based on the loss of performance in terms of signal-to-interference-plus-...
Marc Oudin, Jean Pierre Delmas
AUTOMATICA
2004
64views more  AUTOMATICA 2004»
13 years 6 months ago
Linear LMI-based external anti-windup augmentation for stable linear systems
We study linear anti-windup augmentation for linear control systems with saturated linear plants in the special case when the anti-windup compensator can only modify the input and...
Gene Grimm, Andrew R. Teel, Luca Zaccarian
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 11 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
11 years 9 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 1 months ago
On visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles
— The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based...
Fabio Morbidi, Francesco Bullo, Domenico Prattichi...