Results 1  10
of
798
Schauder bases of integer translates
 Appl. Comput. Harmon. Anal
"... Abstract. For a function Ψ ∈ L2(R), we give necessary and sufficient conditions for the family {Ψ(· − k) : k ∈ Z} to be a Schauder basis for the space Span{Ψ(· − k) : k ∈ ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. For a function Ψ ∈ L2(R), we give necessary and sufficient conditions for the family {Ψ(· − k) : k ∈ Z} to be a Schauder basis for the space Span{Ψ(· − k) : k ∈
On linear independence of integer translates of a finite number of functions
 Proc. Edinburgh Math. Soc
, 1992
"... We investigate linear independence of integer translates of a finite number of compactly supported functions in two cases. In the first case there are no restrictions on the coefficients that may occur in dependence relations. In the second case the coefficient sequences are restricted to be in som ..."
Abstract

Cited by 82 (31 self)
 Add to MetaCart
We investigate linear independence of integer translates of a finite number of compactly supported functions in two cases. In the first case there are no restrictions on the coefficients that may occur in dependence relations. In the second case the coefficient sequences are restricted
The polynomials in the linear span of integer translates of a compactly supported function
 Constr. Approx
, 1987
"... Algebraic facts about the space of polynomials contained in the span of integer translates of a compactly supported function are derived and then used in a discussion of the various quasiinterpolants from that span. ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
Algebraic facts about the space of polynomials contained in the span of integer translates of a compactly supported function are derived and then used in a discussion of the various quasiinterpolants from that span.
Linear Independence of the Integer Translates of Compactly Supported Distributions and Refinable Vectors
, 1998
"... : We investigate the global and local linear independence of any compactly supported distributions by using time domain spaces, and of refinable vectors by invariant linear spaces. Keywords Global linear independence, local linear independence, refinable vector, invariant space AMS Subject Classif ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Classification 41A15, 42C15 1. Introduction For a vector F = (f 1 ; : : : ; f N ) T of nonzero complexvalued compactly supported distributions on IR s , we say that its integer translates are globally linearly independent if X j2ZZ s hd j ; F (\Delta + j)i j 0 on IR s implies d j j 0 8 j 2 ZZ
A Necessary And Sufficient Condition For The Linear Independence Of The Integer Translates Of A Compactly Supported Distribution
 Constr. Approx
, 1987
"... Given a multivariate compactly supported distribution OE, we derive here a necessary and sufficient condition for the global linear independence of its integer translates. This condition is based on the location of the zeros of b OE = The FourierLaplace transform of OE. The utility of the condition ..."
Abstract

Cited by 44 (8 self)
 Add to MetaCart
Given a multivariate compactly supported distribution OE, we derive here a necessary and sufficient condition for the global linear independence of its integer translates. This condition is based on the location of the zeros of b OE = The FourierLaplace transform of OE. The utility
APPROXIMATION IN Lp(R d) FROM SPACES SPANNED BY THE PERTURBED INTEGER TRANSLATES OF A RADIAL FUNCTION
"... The problem of approximating smooth Lpfunctions from spaces spanned by the integer translates of a radially symmetric function is very well understood. In case the points of translation, , are scattered throughout Rd, the approximation problem is only well understood in the \stationary " setti ..."
Abstract
 Add to MetaCart
The problem of approximating smooth Lpfunctions from spaces spanned by the integer translates of a radially symmetric function is very well understood. In case the points of translation, , are scattered throughout Rd, the approximation problem is only well understood in the \stationary "
Approximation in L p (R d ) from Spaces Spanned by the PERTURBED INTEGER TRANSLATES OF A RADIAL FUNCTION
"... The problem of approximating smooth L p functions from spaces spanned by the integer translates of a radially symmetric function OE is very well understood. In case the points of translation, \Xi, are scattered throughout R d , the approximation problem is only well understood in the "statio ..."
Abstract
 Add to MetaCart
The problem of approximating smooth L p functions from spaces spanned by the integer translates of a radially symmetric function OE is very well understood. In case the points of translation, \Xi, are scattered throughout R d , the approximation problem is only well understood in the "
ℓ2linear independence for the system of integer translates of a square integrable function
 PROJECTIONS AND DYADIC PARSEVAL FRAME MRA WAVELETS 19
, 2013
"... ar ..."
Translating pseudoboolean constraints into SAT
 Journal on Satisfiability, Boolean Modeling and Computation
, 2006
"... In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SATsolver. We show that by applying a proper mix of translation techniques, a SATsolver can perfor ..."
Abstract

Cited by 185 (2 self)
 Add to MetaCart
to produce arithmetic circuits more suitable for SAT based reasoning. Keywords: pseudoBoolean, SATsolver, SAT translation, integer linear programming
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
 IEEE Transactions on Computers
, 1981
"... The DAlgorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement Error Correction and Translation (ECAT) functions. PODEM (PathOriented Decision Making) is a new test generation algorithm for combinational logic circuits. PODEM uses an implic ..."
Abstract

Cited by 259 (0 self)
 Add to MetaCart
The DAlgorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement Error Correction and Translation (ECAT) functions. PODEM (PathOriented Decision Making) is a new test generation algorithm for combinational logic circuits. PODEM uses
Results 1  10
of
798