Sciweavers

1996 search results - page 114 / 400
» A decision procedure for linear
Sort
View
AUTOMATICA
2008
152views more  AUTOMATICA 2008»
15 years 6 months ago
A design methodology for switched discrete time linear systems with applications to automotive roll dynamics control
In this paper we consider the asymptotic stability of a class of discrete-time switching linear systems, where each of the constituent subsystems is Schur stable. We first present...
Selim Solmaz, Robert Shorten, Kai Wulff, Fiacre &O...
CDC
2010
IEEE
145views Control Systems» more  CDC 2010»
15 years 1 months ago
Multivariable frequency domain identification using IV-based linear regression
Abstract-- Identification of output error models from frequency domain data generally results in a non-convex optimization problem. A well-known method to approach the output error...
Rogier S. Blom, Paul M. J. Van den Hof
ICASSP
2009
IEEE
16 years 1 months ago
Microarray classification using block diagonal linear discriminant analysis with embedded feature selection
In this paper, block diagonal linear discriminant analysis (BDLDA) is improved and applied to gene expression data. BDLDA is a classification tool with embedded feature selection...
Lingyan Sheng, Roger Pique-Regi, Shahab Asgharzade...
ICALP
2005
Springer
15 years 12 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
RTA
2005
Springer
15 years 12 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...