Results 251 to 260 of about 2,986,842 (293)

Equivalence Classes of Parseval Frames

Mathematical Notes, 2022
The paper studies the notion of ``projective-permutational unitary equivalence'' between two Parseval frames for finite-dimensional Hilbert spaces. Theorem 2 gives a characterization of projective-permutational unitary equivalence between two Parseval frames using their Gram matrices by certain operations on matrices.
Novikov, S. Ya., Sevost'yanova, V. V.
openaire   +2 more sources

Equivalence of Measures of Complexity Classes

SIAM Journal on Computing, 1997
Summary: The resource-bounded measures of complexity classes are shown to be robust with respect to certain changes in the underlying probability measure. Specifically, for any real number \(\delta > 0\), any uniformly polynomial-time computable sequence \(\vec\beta = (\beta_0, \beta_1, \beta_2, \ldots)\) of real numbers (biases) \(\beta_i \in [\delta,
Breutzmann, Josef, Lutz, Jack
openaire   +2 more sources

When are two classes equivalent?

ACM SIGPLAN Notices, 1998
Software written using an object-oriented programming language is made up of classes, which are compile-time entities and objects, that represent the run-tlme instances of these classes. When the software evolves from one version to another, some of these classes might undergo changes.
K. Rangarajan, A. Balasubramaniam
openaire   +1 more source

On equivalent classes of minimal Abelian codes

Journal of Combinatorial Theory, Series A, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuan Ren, Dongchun Han
openaire   +3 more sources

Enhancing equivalence class formation by pretraining of other equivalence classes

The Psychological Record, 1997
This study investigated how the learning of one set of equivalence classes enhances the learning of new equivalence classes. Fifty-two undergraduate students were divided into four groups. Subjects in Group 1 received no pretraining. Using the simple-to-complex procedure followed by incremental expansion of class size, subjects in Groups 2, 3, and 4 ...
Dawn M. Buffington, Lanny Fields, Barbara J. Adams   +2 more
openaire   +1 more source

Affine Equivalent Classes of Parallelohedra

2011
In the paper the affine equivalence relation in the set of parallelohedra is studied. One proves the uniqueness theorem for a wide class of d-dimensional parallelohedra. From here it follows that for every d (≥2) the space of affine equivalent classes of d-dimensional primitive parallelohedra has dimension d(d+1)/2−1.
Nikolai P. Dolbilin, Jin-ichi Itoh, Chie Nara   +2 more
openaire   +2 more sources

On equivalence classes of interpolation equations

1995
An Interpolation Equation is an equation of the form [(x)c 1 ... c n=b], where c 1 ... c n , b are simply typed terms containing no instantiable variable. A natural equivalence relation between two interpolation equations is the equality of their sets of solutions.
openaire   +3 more sources

Complement-equivalence classes on graphs

1997
A complementation operation on a vertex of a digraph changes all outgoing edges into nonedges, and outgoing nonedges into edges. A similar operation is defined for incoming edges. This defines an equivalence relation where two graphs are equivalent if one can be obtained from the other by a sequence of such operations.
openaire   +1 more source

Switching Equivalence Classes of Perfect Codes

Designs, Codes and Cryptography, 1999
A binary 1-error correcting perfect code is called switching equivalent to the Hamming code (of the same parameters) if there is a sequence of switches (replacing a specially selected set of codewords for another set of words) which leads to the Hamming code. \textit{S. V. Avgustinovich} and \textit{F. I.
Kevin T. Phelps, Mike LeVan
openaire   +1 more source

On the Equivalence of Classes of Numerical Sequences

Analysis Mathematica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources