Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"inner-product function"”.

  1. A Generalized Study of the Conjugate and Inner-Product Functions

    The usual practice in any discussion of an inner-product space is to restrict the field over which the inner-product space is defined to the field of complex numbers. In defining the inner-product function, (x,y), a second function is needed; namely the conjugate function (x,y)* so that (x,y) ± …

    unt Repository record for A Generalized Study of the Conjugate and Inner-Product Functions (opens in a new tab)

  2. Constant Lower Bounds on the Cryptographic Security of Quantum Two-Party Computations

    … on the security of quantum protocols for secure function evaluation. Central to our proof is the concept of gentle measurements of quantum states, which do not greatly disturb a quantum state if a certain outcome is obtained with high probability. We show how a cheating party can leverage gentle …

    vt Repository record for Constant Lower Bounds on the Cryptographic Security of Quantum Two-Party Computations (opens in a new tab)

  3. Experimental comparison of schemes for interpreting Boolean queries

    … Paice, MMM and then TIRS. This study employs the INNER PRODUCT function for computing the similarity between a document point and a query point in TIRS. There may be other choices of similarity functions for TIRS, but irrespective of the function used, the TIRS approach, having to deal with …

    vt Repository record for Experimental comparison of schemes for interpreting Boolean queries (opens in a new tab)

  4. Lower Bounds on Average-Case and Non-Local Quantum Computation

    … state that completes these tasks for a given function f(x,y) in terms of the rank of a matrix G whose entries are zero when f(x,y)=0 and strictly positive otherwise. This also leads to a lower bound in terms of the non-deterministic quantum communication complexity of f. Due to a relationship …

    waterloo Repository record for Lower Bounds on Average-Case and Non-Local Quantum Computation (opens in a new tab)

  5. One-vector representations of stochastic signals for pattern recognition

    … a sequential gradient descent search on a loss functional for a good fit in an inner product function space. The boosting Baum-Welch algorithm can serve as an alternative maximum likelihood learning algorithm for HMMs to the traditional Baum-Welch or expectation-maximization (EM) algorithm, and …

    uiuc Repository record for One-vector representations of stochastic signals for pattern recognition (opens in a new tab)