Essays about: "factorisation"

Showing result 6 - 10 of 13 essays containing the word factorisation.

  1. 6. Modelling the Number of Periodic Points of Quadratic Maps Using Random Maps

    University essay from Linnéuniversitetet/Institutionen för matematik (MA)

    Author : Jakob Streipel; [2017]
    Keywords : arithmetic dynamical systems; periodic points; quadratic maps; random maps;

    Abstract : Since the introduction of Pollard's rho method for integer factorisation in 1975 there has been great interest in understanding the dynamics of quadratic maps over finite fields. One avenue for this, and indeed the heuristic on which Pollard bases the proof of the method's efficacy, is the idea that quadratic maps behave roughly like random maps. READ MORE

  3. 7. Hybrid Model Approach to Appliance Load Disaggregation : Expressive appliance modelling by combining convolutional neural networks and hidden semi Markov models.

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Anders Huss; [2015]
    Keywords : NILM; disaggregation; neural network; convolutional neural network; CNN; HMM; HSMM;

    Abstract : The increasing energy consumption is one of the greatest environmental challenges of our time. Residential buildings account for a considerable part of the total electricity consumption and is further a sector that is shown to have large savings potential. Non Intrusive Load Monitoring (NILM), i.e. READ MORE

  4. 8. DSP implementation of the Cholesky factorisation

    University essay from Linköpings universitet/Datorteknik; Linköpings universitet/Tekniska högskolan

    Author : Arvid Winqvist; [2014]
    Keywords : Cholesky factorisation; DSP;

    Abstract : The Cholesky factorisation is an efficient tool that, when used correctly, significantlycan reduce the computational complexity in many applications. This thesiscontains an in-depth study of the factorisation, some of its applications andan implementation on the Coresonic SIMT DSP architecture. .. READ MORE

  5. 9. A comparison of reductions from FACT to CNF-SAT

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : John Eriksson; Jonas Höglund; [2014]
    Keywords : ;

    Abstract : The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNF-SAT), a well-known NP-complete problem. READ MORE

  6. 10. A comparison of reductions from FACT to CNF-SAT

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : JOHN ERIKSSON; JONAS HÖGLUND; [2014]
    Keywords : ;

    Abstract : The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNFSAT),a well-known NP-complete problem. READ MORE