Sciweavers

4277 search results - page 60 / 856
» On Multiple Linear Approximations
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Polynomial expansion detector for uniform linear arrays
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
Antonia Maria Masucci, Øyvind Ryan, M&eacut...
JCAM
2011
91views more  JCAM 2011»
14 years 25 days ago
Numerical solution of linear Volterra integral equations of the second kind with sharp gradients
Collocation methods are a well developed approach for the numerical solution of smooth and weakly-singular Volterra integral equations. In this paper we extend these methods, thro...
Samuel A. Isaacson, Robert M. Kirby
NIPS
2003
14 years 11 months ago
Multiple-Instance Learning via Disjunctive Programming Boosting
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
Stuart Andrews, Thomas Hofmann
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
14 years 11 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
14 years 10 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison