Sciweavers

1469 search results - page 70 / 294
» Approximate polynomial decomposition
Sort
View
OL
2011
190views Neural Networks» more  OL 2011»
14 years 4 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
COMPUTING
2007
108views more  COMPUTING 2007»
14 years 9 months ago
Accurate evaluation of divided differences for polynomial interpolation of exponential propagators
In this paper, we propose an approach to the computation of more accurate divided differences for the interpolation in the Newton form of the matrix exponential propagator ϕ(hA)v...
Marco Caliari
APCCAS
2006
IEEE
206views Hardware» more  APCCAS 2006»
15 years 1 months ago
On the Properties And Design of Stable IIR Transfer Functions Generated Using Fibonnaci Numbers
This paper considers z-domain transfer functions whose denominator polynomial possesses the property that the coefficient of zi is greater than the coefficient of zi-1 . Such trans...
Christian S. Gargour, Venkat Ramachandran, Ravi P....
CVPR
2010
IEEE
14 years 7 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 19 days ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...