Sciweavers

4057 search results - page 317 / 812
» Linear combination of transformations
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
Vincent Yan Fu Tan, Vivek K. Goyal
DAM
2006
78views more  DAM 2006»
15 years 6 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
COMPUTING
2007
103views more  COMPUTING 2007»
15 years 6 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
JPDC
2006
94views more  JPDC 2006»
15 years 6 months ago
Exchanging messages of different sizes
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...
Alfredo Goldman, Joseph G. Peters, Denis Trystram
SIAMJO
2008
212views more  SIAMJO 2008»
15 years 6 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera