Sciweavers

3670 search results - page 300 / 734
» Linear Recursive Functions
Sort
View
ANTS
1998
Springer
135views Algorithms» more  ANTS 1998»
15 years 11 months ago
Fast Multiprecision Evaluation of Series of Rational Numbers
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
Bruno Haible, Thomas Papanikolaou
COR
2006
86views more  COR 2006»
15 years 6 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
15 years 6 months ago
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
Arvind Ayyer, Doron Zeilberger
MCSS
2008
Springer
15 years 6 months ago
Weakly coprime factorization and state-feedback stabilization of discrete-time systems
Abstract: The LQ-optimal state feedback of a finite-dimensional linear time-invariant system determines a coprime factorization NM-1 of the transfer function. We show that the same...
Kalle M. Mikkola
IPL
2007
104views more  IPL 2007»
15 years 6 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink