Sciweavers

2816 search results - page 180 / 564
» Submodular function minimization
Sort
View
127
Voted
EOR
2008
159views more  EOR 2008»
15 years 2 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
90
Voted
TCSV
2008
87views more  TCSV 2008»
15 years 2 months ago
On Iterative Regularization and Its Application
Many existing techniques for image restoration can be expressed in terms of minimizing a particular cost function. Iterative regularization methods are a novel variation on this th...
Michael R. Charest, Peyman Milanfar
87
Voted
TSP
2008
180views more  TSP 2008»
15 years 2 months ago
A Square-Root Nyquist (M) Filter Design for Digital Communication Systems
Designing matched transmit and receive filters such that their combination satisfies the Nyquist condition is a classical problem in digital communication systems. In this paper, ...
Behrouz Farhang-Boroujeny
JMLR
2002
160views more  JMLR 2002»
15 years 2 months ago
Kernel Independent Component Analysis
We present a class of algorithms for independent component analysis (ICA) which use contrast functions based on canonical correlations in a reproducing kernel Hilbert space. On th...
Francis R. Bach, Michael I. Jordan
TNN
1998
100views more  TNN 1998»
15 years 2 months ago
A dynamical system perspective of structural learning with forgetting
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
D. A. Miller, J. M. Zurada