Sciweavers

196 search results - page 11 / 40
» A finite set of functions with an EXPTIME-complete compositi...
Sort
View
FTRTFT
1994
Springer
15 years 3 months ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
Manfred Broy, Ketil Stølen
ML
2002
ACM
127views Machine Learning» more  ML 2002»
14 years 11 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
14 years 11 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
JSAC
2008
86views more  JSAC 2008»
14 years 11 months ago
Distributed function calculation and consensus using linear iterative strategies
Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node val...
Shreyas Sundaram, Christoforos N. Hadjicostis
SIAMSC
2008
147views more  SIAMSC 2008»
14 years 11 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer