Sciweavers

310 search results - page 27 / 62
» An error bound for model reduction of Lur'e-type systems
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CAV
2008
Springer
113views Hardware» more  CAV 2008»
13 years 10 months ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg
ACL
2008
13 years 10 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
ICASSP
2008
IEEE
14 years 2 months ago
Speech enhancement using a pitch predictive model
In this paper we present two new methods for speech enhancement based on the previously publised ne pitch model (FPM) for voiced speech. The rst method (FPM-NE) uses the FPM to pr...
Luis Buera, Jasha Droppo, Alex Acero
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
14 years 1 months ago
Bilevel programming for analysis of low-complexity control of linear systems with constraints
— In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinitynorm difference...
Henrik Manum, Colin Neil Jones, Johan Löfberg...