Skip to content

1ambda

high-functioning developer trained by unsupervised compilers

  • Home
  • Thoughts
  • About

Category

  • Algorithm (14)
    • Algorithm Part 1 (8)
    • Design & Analysis (6)
  • Basic (1)
  • Data Analysis (11)
    • Experimentation Platform (1)
    • Machine Learning (10)
  • Distributed System (7)
  • Functional Language (27)
    • Haskell Intro (10)
    • Scala: Easy Scalaz (6)
    • Scala: Functional (6)
    • Scala: Reactive (5)
  • Golang (1)
  • Infrastructure (2)
    • AWS (1)
  • Thoughts (1)

Recent Posts

  • Booking.com 에서 온라인 실험을 제공하는 법 (요약)
  • AWS EMR 을 Terraform 으로 관리할 때 도움되는 몇 가지 팁들
  • 1년간 그가 스타트업 정글에서 살아남은 방법
  • Machine Learning 10 – Stochastic Gradient, Synthetic Data, Ceiling Analysis
  • Machine Learning 9 – Anomaly Detection, Recommender System

Recent Comments

chiyodad 🍅 (@chiyoda… on 1년간 그가 스타트업 정글에서 살아남은 방법
[1ambda] AWS EMR 을 T… on AWS EMR 을 Terraform 으로 관리할 때 도…
1ambda on 1년간 그가 스타트업 정글에서 살아남은 방법
강성훈 on 1년간 그가 스타트업 정글에서 살아남은 방법

Archives

  • January 2020
  • January 2019
  • July 2018
  • June 2018
  • GitHub
  • Facebook
  • WordPress

RSS

RSS Feed

Category: Algorithm

Algorithm Design & Analysis 6 – Hash Table, Universal Hashing, Bloom filters

Algorithm Design & Analysis 6 – Hash Table, Universal Hashing, Bloom filters

Coursera 에서 제공하는 Stanford 대학교의 Algorithm Design & Analysis 수업 중 6 번째 챕터입니다. Continue reading Algorithm Design & Analysis 6 – Hash Table, Universal Hashing, Bloom filters

Posted on June 30, 2018June 30, 2018Categories Algorithm, Design & AnalysisLeave a comment on Algorithm Design & Analysis 6 – Hash Table, Universal Hashing, Bloom filters
Algorithm Design & Analysis 5 – Dijkstra, Heap, Red-Black Tree

Algorithm Design & Analysis 5 – Dijkstra, Heap, Red-Black Tree

Coursera 에서 제공하는 Stanford 대학교의 Algorithm Design & Analysis 수업 중 5 번째 챕터입니다. Continue reading Algorithm Design & Analysis 5 – Dijkstra, Heap, Red-Black Tree

Posted on June 30, 2018June 30, 2018Categories Algorithm, Design & AnalysisLeave a comment on Algorithm Design & Analysis 5 – Dijkstra, Heap, Red-Black Tree
Algorithm Design & Analysis 4 – Graph Search and Connectivity

Algorithm Design & Analysis 4 – Graph Search and Connectivity

Coursera 에서 제공하는 Stanford 대학교의 Algorithm Design & Analysis 수업 중 4 번째 챕터입니다. Continue reading Algorithm Design & Analysis 4 – Graph Search and Connectivity

Posted on June 30, 2018June 30, 2018Categories Algorithm, Design & AnalysisLeave a comment on Algorithm Design & Analysis 4 – Graph Search and Connectivity
Algorithm Design & Analysis 3 – Graphs, The Contraction Algorithm

Algorithm Design & Analysis 3 – Graphs, The Contraction Algorithm

Coursera 에서 제공하는 Stanford 대학교의 Algorithm Design & Analysis 수업 중 3 번째 챕터입니다. Continue reading Algorithm Design & Analysis 3 – Graphs, The Contraction Algorithm

Posted on June 30, 2018June 30, 2018Categories Algorithm, Design & AnalysisLeave a comment on Algorithm Design & Analysis 3 – Graphs, The Contraction Algorithm
Algorithm Design & Analysis 2 – Randomized Selection

Algorithm Design & Analysis 2 – Randomized Selection

Coursera 에서 제공하는 Stanford 대학교의 Algorithm Design & Analysis 수업 중 2 번째 챕터입니다. Continue reading Algorithm Design & Analysis 2 – Randomized Selection

Posted on June 30, 2018June 30, 2018Categories Algorithm, Design & AnalysisLeave a comment on Algorithm Design & Analysis 2 – Randomized Selection

Posts navigation

Page 1 Page 2 Page 3 Next page
Website Built with WordPress.com.
1ambda
Website Built with WordPress.com.
Cancel