Sciweavers

1672 search results - page 144 / 335
» Tightness problems in the plane
Sort
View
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
15 years 3 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
DAC
1995
ACM
15 years 2 months ago
Conflict Modelling and Instruction Scheduling in Code Generation for In-House DSP Cores
Application domain specific DSP cores are becoming increasingly popular due to their advantageous trade–off between flexibility and cost. However, existing code generation metho...
Adwin H. Timmer, Marino T. J. Strik, Jef L. van Me...
NIPS
2004
15 years 17 days ago
Optimal Aggregation of Classifiers and Boosting Maps in Functional Magnetic Resonance Imaging
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
Vladimir Koltchinskii, Manel Martínez-Ram&o...
COLING
1996
15 years 15 days ago
Modularizing Codescriptive Grammars for Efficient Parsing
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
Walter Kasper, Hans-Ulrich Krieger
CORR
2006
Springer
164views Education» more  CORR 2006»
14 years 11 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey