Lecture

Results: 18028



#Item
981

LECTURE RECORDING IN HIGHER EDUCATION: RISKY BUSINESS OR EVOLVING OPEN PRACTICE

Add to Reading List

Source URL: ukcopyrightliteracy.files.wordpress.com

- Date: 2016-11-04 13:05:33
    982

    princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 9: Decision-making under total uncertainty: the multiplicative weight algorithm

    Add to Reading List

    Source URL: www.cs.princeton.edu

    - Date: 2014-10-09 18:58:38
      983

      Lecture  2   White-­‐box  Tes2ng  and     Structural  Coverage   (see  Amman  and  Offut,  Chapter  2)   White-­‐box  Tes2ng    

      Add to Reading List

      Source URL: www.nada.kth.se

      - Date: 2014-02-06 05:42:26
        984

        princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 1: Course Intro and Hashing Lecturer: Sanjeev Arora

        Add to Reading List

        Source URL: www.cs.princeton.edu

        - Date: 2014-09-17 11:30:55
          985

          A preliminary version of this paper appears in Advances in Cryptology – ASIACRYPT ’09, Lecture Notes in Computer Science Vol. 5912, pp. 232–249, Mitsuru Matsui ed., Springer-Verlag, 2009. This is the full version.

          Add to Reading List

          Source URL: eprint.iacr.org

          - Date: 2012-04-21 16:20:41
            986

            Foundation of Scientific Computing Prof. T. K. Sengupta Department of Aerospace Engineering Indian Institute of Technology, Kanpur Lecture No. # 01 First of all, let us talk about the scope and syllabus of this course ti

            Add to Reading List

            Source URL: textofvideo.nptel.iitm.ac.in

            - Date: 2016-01-14 08:37:55
              987

              CSG399: Gems of Theoretical Computer Science. Instructor: Emanuele Viola Lecture 10. Feb. 13, 2009. Scribe: Fangfei Zhou

              Add to Reading List

              Source URL: www.ccs.neu.edu

              - Date: 2009-03-13 10:03:22
                988

                PGM lecture notes: pseudo-likelihood Amir Globerson (modified by David Sontag) Consider a pairwise Markov random field and data {x(m) }m=1...M : 1 Pij θij (xi ,xj ) e Z(θ)

                Add to Reading List

                Source URL: cs.nyu.edu

                - Date: 2015-11-17 16:00:53
                  989

                  Lecture  6   Model-­‐based  Tes2ng     and  Automated  Test  Case  Genera2on   Automated  Test-­‐Case  Genera2on   (TCG)  

                  Add to Reading List

                  Source URL: www.nada.kth.se

                  - Date: 2012-01-30 05:30:33
                    990

                    Planning a SEMINAR / LECTURE A SEMINAR would have one MAIN SPEAKER who would deliver a presentation for a set amount of time. There would then be a Q&A session for the audience which could be facilitated by a CHAIR if yo

                    Add to Reading List

                    Source URL: peoplesppedotcom.files.wordpress.com

                    - Date: 2016-04-03 18:19:20
                      UPDATE