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 “"APPLIED ALGEBRA"”.

  1. Connectedness of Hilbert scheme strata defined by bounding cohomology

    … other connectedness results, Journal of Pure and Applied Algebra 150 (2000), 175- 205] untersucht worden sind, weiterentwickelt. Es stellt sich heraus, dass die von Mall konstruierten Binomialideale Cohen-Macaulay-filtriert sind und dass für diese Ideale das Initialideal und das generische …

    zurich

  2. Algebraic methods for chemical reaction networks with extrinsic noise

    … constant, but unknown parameters, parameter-free algebraic methods are developed in this thesis to study large classes of chemical reaction networks named families. In particular, these methods allow for parameter-free model rejection, or model testing and give upper bounds on the algebraic …

    oxford Repository record for Algebraic methods for chemical reaction networks with extrinsic noise (opens in a new tab)

  3. Geometry of Optimization in Markov Decision Processes and Neural Network-Based PDE Solvers

    … Markov decision processes using tools from algebraic statistics and information geometry, which can be viewed as neighboring fields of applied algebra and differential geometry, respectively. Here, we focus on infinite horizon problems and memoryless stochastic policies. Markov decision …

    qucosa-diss

  4. Mathematical Background of the Special Number Field Sieve

    … some additional prerequisite background in algebraic number theory—notably properties of integral extensions, ideal factorization in Dedekind domains, and splitting of primes in number rings. Lastly, we survey Pollard’s original paper, in which he uses a cubic extension of the integers to …

    ku Repository record for Mathematical Background of the Special Number Field Sieve (opens in a new tab)

  5. ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ

    THE PH.D. DISSERTATION DEALS WITH THE DEVELOPMENT OF NEW ALGORITHMS FOR DIGITAL SIGNAL PROCESSING, HAVING GOOD COMPUTATIONAL COMPLEXITY CHARACTERISTICS, SMALL MEMORY REQUIREMENTS AND SMALL COMPUTATION ERRORS. NEW IN-PLACE DFT ALGORITHMS ARE DEVELOPED. SOME NEW MULTIDIMENSIONAL DFT ALGORITHMS HAVING …

    greece Repository record for ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ (opens in a new tab)