8. Randomization: Universal & Perfect Hashing
MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Erik Demaine
In this lecture, Professor Demaine reviews hashing in the context of randomized algorithms.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 8. Randomization: Universal & Perfect Hashing канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Erik Demaine
In this lecture, Professor Demaine reviews hashing in the context of randomized algorithms.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 8. Randomization: Universal & Perfect Hashing канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
23. Team Discussions18. Roth's theorem I: Fourier analytic proof over finite fieldGilbert and Cleve IntroductionCourse Introduction | MIT 18.06SC Linear AlgebraAn Interview with Gilbert Strang on Teaching Linear AlgebraGenomic and cDNA Libraries | MIT 7.01SC Fundamentals of BiologyCourse Introduction of 18.065 by Professor StrangSubspaces of Three Dimensional Space35. Finding Clusters in Graphs15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, BowlingLecture 1: The Column Space of A Contains All Vectors AxIntro: A New Way to Start Linear AlgebraOverview of Differential EquationsCourse Introduction | MIT 18.06SC Linear AlgebraL19.2 Energy eigenstates: incident and outgoing waves. Scattering amplitudeTutorial: Texturing8.01SC Classical Mechanics Introduction11. Learning: Identification Trees, Disorder7. ReplicationL1.1 General problem. Non-degenerate perturbation theoryThe Next Generation of OCW is Here!