Sciweavers

3007 search results - page 126 / 602
» Linear Functional Fixed-points
Sort
View
ISCAS
2005
IEEE
142views Hardware» more  ISCAS 2005»
15 years 5 months ago
A class of novel blind source extraction algorithms based on a linear predictor
A rigorous analysis of the performance of a blind source extraction structure based on a linear predictor is provided. It is shown that by minimising the mean square prediction er...
Wei Liu, Danilo P. Mandic, Andrzej Cichocki
TAPIA
2003
ACM
15 years 5 months ago
A new infeasible interior-point algorithm for linear programming
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Miguel Argáez, Leticia Velázquez
WCNC
2010
IEEE
15 years 3 months ago
Optimality of Diagonalization of Multicarrier Multi-Hop Linear Non-Regenerative MIMO Relays
Abstract—In this paper, a multicarrier multi-hop multipleinput multiple-output (MIMO) relay system is investigated. A linear non-regenerative strategy is applied at each relay no...
Yue Rong, Yingbo Hua
AAAI
1997
15 years 1 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
15 years 1 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner