1469 search results - page 58 / 294 » Approximate polynomial decomposition |
CGI
1998
IEEE
15 years 2 months ago
1998
IEEE
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...
CVPR
1996
IEEE
15 years 2 months ago
1996
IEEE
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
FSE
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
ALT
2004
Springer
15 years 6 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...