Search for tag: "algorithm"

121 Media

48:06 ECS 235A Fall Quarter 2021, Lecture 9, October… ECS 235A Fall Quarter 2021, Lecture 9, October 11, 2021	ECS 235A Fall Quarter 2021, Lecture 9, October 11, 2021 This is the video of the ninth lecture. It's crude as I made it from my laptop, as the room has no video recording. Still not top of the line. key alice bob session hash judge signature party bits checksum function keys kathy cryptography messages encryption point interchange algorithm things From Matt Bishop 0 likes 14 plays 0
06:47 How Does a Quantum Computer Work? How Does a Quantum Computer Work?	How Does a Quantum Computer Work? from Veritasiumhttps://www.youtube.com/watch?v=g_IaVepNDT4 bits computer result numbers spin electron coefficient field operations operation superposition quantum energy algorithm calculations qubits From John Terning 0 likes 10 plays 0
26:49 ECS222A Project - Chuan Hsin Cho, Yu Hsuan Tseng ECS222A Project - Chuan Hsin Cho, Yu Hsuan Tseng	ECS222A Project - Chuan Hsin Cho, Yu Hsuan Tseng Paper: Nyberg, Daniel. (2011). Analysis of Two Common Hidden Surface Removal Algorithms, Painter’s Algorithm & Z-Buffering.Kandidatexjobb CSC ; K11061. algorithm polygons buffer painter polygon problem pixel algorithms space tree frame bsp image color depth result elements statement fashion memory From Chuan-Hsin Cho 0 likes 15 plays 0
55:59 ECS 153, Spring 2021; Lecture #23; May 19, 2021 ECS 153, Spring 2021; Lecture #23; May 19, 2021	ECS 153, Spring 2021; Lecture #23; May 19, 2021 ECS 153 Spring 2021. Computer Security. This covers authentication with a brief overview of rainbow tables and begins access control mechanisms. The video begins at 5:13 from the beginning. password passwords rainbow access function table hash control challenge unix things authentication point idea tables computer algorithm reduction bits key From Matt Bishop 0 likes 42 plays 0
57:06 ECS 153, Spring 2021; Lecture #22; May 17, 2021 ECS 153, Spring 2021; Lecture #22; May 17, 2021	ECS 153, Spring 2021; Lecture #22; May 17, 2021 ECS 153 Spring 2021. Computer Security. This covers the POODLE attack on SSL and begins authentication. The video begins at 8:16 from the beginning. password passwords hash block problem authentication function functions byte complementation padding algorithm things characters seed words word identity access login From Matt Bishop 0 likes 29 plays 0
47:29 abiy.tasissa.5.11 abiy.tasissa.5.11	abiy.tasissa.5.11 Abstract: Sparse Manifold clustering and embedding (SMCE) is an algorithm to cluster nonlinear manifolds using self-representation in the dictionary of data points and a proximity regularization. A… points point problem atoms clustering coefficients dictionary reconstruction subspace algorithm graph sparsity coefficient network matrix representations linear representation manifold triangulation From Stefan Schonsheck 0 likes 4 plays 0
04:44 Transabdominal Fetal Pulse Oximetry for… Transabdominal Fetal Pulse Oximetry for Intrapartum Fetal Monitoring	Transabdominal Fetal Pulse Oximetry for Intrapartum Fetal Monitoring Sensing, Imaging and Signal Processing 12 Team Lead: Begum Kasap Advisor: Prof. Ghiasi saturation oxygen rate heart signal modulation ratio light detector algorithm surface blood oximetry error reference ppg photo method pulse trend From Femi-Jide Akinmoladun 0 likes 13 plays 0
01:43:03 Meeting 5-4-21: Backpropagation and the Brain Meeting 5-4-21: Backpropagation and the Brain	Meeting 5-4-21: Backpropagation and the Brain Mehmet Berkay leads a discussion on the potential biological basis for backpropagation and a justification for its uses in spiking neural networks. backpropagation brain learning network timing feedback hardware algorithm neurons neuron weight computing problem computer signal From Luis El Srouji 0 likes 16 plays 0
54:16 ECS 153, Spring 2021; Lecture #10; April 19, 2021 ECS 153, Spring 2021; Lecture #10; April 19, 2021	ECS 153, Spring 2021; Lecture #10; April 19, 2021 ECS 153 Spring 2021. Computer Security. This finishes the discussion of access control matrices and begins one on security policies. The video begins at 2:47 from the beginning. confidentiality access integrity problem algorithm systems question things bit policies copy owner permission patch control hm homework availability model reason From Matt Bishop 0 likes 62 plays 0
15:27 Efficient Fixpoint Computation for Abstract… Efficient Fixpoint Computation for Abstract Interpretation	Efficient Fixpoint Computation for Abstract Interpretation Abstract interpretation is a general framework for expressing static program analyses. It reduces the problem of extracting properties of a program to computing an approximation of the least fixpoint… point computation strategy memory wto algorithm graph iteration analysis loop points checks approach dependency equations stabilization efficiency mutation values equation From Aditya Thakur 0 likes 18 plays 0
01:00:54 ECS 153, Spring 2021; Lecture #2; March 31, 2021 ECS 153, Spring 2021; Lecture #2; March 31, 2021	ECS 153, Spring 2021; Lecture #2; March 31, 2021 ECS 153, Spring 2021. Computer Security. This covers the design principles of security. The lecture starts ar 8:07 into the video. things password access lot passwords root money privilege authentication directory reason factor point systems algorithm principles problem thing administrators error From Matt Bishop 0 likes 98 plays 0
04:34 ECS 120 0:6 pigeonhole principle (discrete math… ECS 120 0:6 pigeonhole principle (discrete math review)	ECS 120 0:6 pigeonhole principle (discrete math review) boxes compression files algorithm cards pigeons objects bytes numbers application box principle size pigeon suits deck networks things room arguments From David Doty 1 likes 119 plays 0
01:19:33 ECS 289A Lecture 3a ECS 289A Lecture 3a	ECS 289A Lecture 3a tiles shape tile probability thing string question length determinism delta heads variables times assembly power types coin clause algorithm problem From David Doty 0 likes 7 plays 0
15:53 ECS 220 9b:8.5 Immerman-Szelepcsényi… ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n)	ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n) space nodes reachability path algorithm node error steps bit proof paths length end graph zeros pad linear log guesses step From David Doty 0 likes 18 plays 0
09:03 ECS 220 8c:8.4 Savitch's theorem… ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm	ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm space log algorithm path nodes length graph reachability recursion n. bits half memory point root levels level node call stack From David Doty 0 likes 15 plays 0
05:20 ECS 220 8a:8.2 NL and NPSPACE nondeterministic… ECS 220 8a:8.2 NL and NPSPACE nondeterministic space-bounded computation and prover-verifier characterization	ECS 220 8a:8.2 NL and NPSPACE nondeterministic space-bounded computation and prover-verifier characterization space characterization witness length access bits verifier w. np instance path problem computation tape slide memory answer algorithm machine turing From David Doty 0 likes 20 plays 0