# [d2대학생세미나]lovely algrorithm

Post on 15-Jan-2015

4.680 views

Category:

## Technology

Embed Size (px)

DESCRIPTION

[D2대학생세미나]lovely algrorithm

TRANSCRIPT

• 1.

2. , , . SLAM DUNK, ', , 3. ~ ~, ~ ~ TV 4. ? 5. . ... , ... ... ... ... ... ... 6. http://www.thisismoney.co.uk/money/news/article-2177769/Ride-like-Wiggins-The-best-road-bikes-500.html http://wdc2010.tistory.com/174 7. ... . . . 8. .!!! . . . 9. . , , ? ? ? 10. 11. ? ? 12. 13. 14. f ' >0 f (t +t )>f (t) 15. ( | ) & 16. #1 & 17. #2 & 18. #3 & 19. / . 20. / . 21. '90 A ' if (score >= 90) { grade = Grade.A; } 95 A ? 85 A ? 97 B ? 22. Imply Truth Table A B A B True True True True False False False True True False False True '90 A ' 95 A ? 85 A ? 97 B ? 23. (Propositional Calculus) 24. Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods 25. Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 Introduction and proofs Induction Strong induction Number theory I Number theory II Graph theory and coloring Matching problems Graph theory II: minimum spanning trees Communication networks Graph theory III Relations, partial orders, and scheduling Sums Sums and Asymptotics Divide and conquer recurrences Linear recurrences Counting rules I Counting rules II Probability introduction Conditional probability Independence Random variables Expectation I Expectation II Large deviations Random walks 26. / 27. / ' ' ( 30 .) 28. ? . . - ( ) http://commons.wikimedia.org/wiki/File:Archimedes_lever.png 29. Reduction ( ) A B B A , A B . http://ko.wikipedia.org/wiki/_() , ( ) . - , 30. Convex Hull http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap35.htm http://www.voronoi.com/wiki/index.php?title=Vector_Algebra_%26_Geometry 31. http://www.dk.co.uk/nf/Book/BookDisplay/0,,9781405349925,00.html?/Football_Skills_DK_Publishing 32. & Array, List Stack, Queue, Priority Queue Sort(Insertion, Heap, Merge, Quick) Binary Search Union Find Binary Search Tree, Red-Black Tree Hash, HashTable Huffman Codes SubString Search Graph Shortest Path (Dijkstra, Bellman-Ford) Minimum Spanning Tree (Prim, Kruskal) Trie Maxflow Divide & Conquer Greedy Algorithm Dynamic Algorithm P != NP ? 33. . . ? 34. , http://www.foxsports.com.au/olympic-games/events/ugandas-stephen-kiprotich-has-won-the-london-olympics-marathon/story-fnd7zc3y-1226448756056?nk=4b7cb839581f0c61d2dd f6c335741faa http://article.joins.com/news/article/article.asp?total_id=3684161&cloc 35. . 36. . . 37. Seam Carving, content aware image resizing http://en.wikipedia.org/wiki/Seam_carving . , . 38. The energy of pixel E(x, y) = x2 (x, y) + y2 (x, y) E(x, y) , Dynamic Programming Seam Carving, content aware image resizing ? = ? http://www.cs.princeton.edu/courses/archive/spr13/cos226/assignments/seamCarving.html 39. DBMS Index & Query Performance http://cis.stvincent.edu/html/tutorials/swd/btree/btree.html CREATE INDEX clm1_idx ON tbl(clm1); CREATE INDEX clm2_idx ON tbl(clm2); SELECT * FROM tbl WHERE (clm1 >= 10 AND clm1 100 AND clm2 < 5000) LIMIT 2000; 40. DBMS Index & Query Performance WHERE (clm1 >= 10 AND clm1 100 AND clm2 < 5000) 41. Machine Learning (machine learning) , . , . http://ko.wikipedia.org/wiki/_ 42. Machine Learning 43. Machine Learning 2 ? 3 ? 44. Machine Learning . boolean ( ) { if(! ( ( )) { if (! ( )) { return false; } else if (...) { if (...) { } else if(...) { if (...) { ... } else if(...) { ... } } } else if () { ... } } ... 100 if !!!! tothe 45. Machine Learning !!! 1 1+e h( x) 46. Machine Learning !!! 1 1+e h( x) h(x) 47. Machine Learning 1 2 h( x1, x2)>0 h( x1, x2)

Recommended