38 search results - page 4 / 8 » Approximate Integer Common Divisors |
AUTOMATICA
2008
13 years 7 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
ISSAC
2009
Springer
14 years 1 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
ICIP
1997
IEEE
14 years 8 months ago
1997
IEEE
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
COCOON
2005
Springer
14 years 15 days ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
WEA
2005
Springer
14 years 13 days ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...