Sciweavers

1909 search results - page 282 / 382
» Generalized Filtering Decomposition
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 1 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
14 years 1 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
ICALP
1993
Springer
14 years 1 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
14 years 1 months ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
FASE
2008
Springer
13 years 11 months ago
Consistent Integration of Models Based on Views of Visual Languages
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Ulrik...