Applying to Ph.D. Programs in Computer Science

  Author: Mor Harchol-Balter (Computer Science Department Carnegie Mellon University) Last updated: 2014 1 Introduction This document is intended for people applying to Ph.D. programs in computer science or related areas. The author is a professor of computer science at CMU, and has been involved in the Ph.D. admissions process at CMU, U.C. Berkeley, and MIT. 2 Do I […]

Sequence to Sequence Learning with Neural Networks | Summary

References Ilya Sutskever, Oriol Vinyals, Quoc V. Le (2014). “Sequence to Sequence Learning with Neural Networks”. NIPS 2014: 3104-3112. [PDF] Sequence-to-Sequence Models. TensorFlow [LINK] The official tutorial for sequence-to-sequence models. Seq2seq Library (contrib). Tensorflow [LINK] Translation with a Sequence to Sequence Network and Attention. PyTorch. [LINK]

How to Install Caffe

Install Caffe on Linux Ubuntu 16.04 My Configurations Linux: Ubuntu 16.04 LTS Anaconda: Anaconda 2 (64-bit), CPU or GPU: CPU Install Caffe 1. Install CUDA 8 (Optional. I failed this installation.) Go to the CUDA download page( ‘ Go to the directory where the downloaded file is located.

I got an error. Hit CTRL+ALT+F1 […]

Kruskal’s Algorithm

Kruskal’s Algorithm Approach: greedy approach Purpose: to find a minimum spanning tree in a weighted graph Example   References Kruskal’s Algorithm | Essay Assignment | Seminar on Advanced Mathematics Spanning Tree | tutorialspoint Kruskal’s Spanning Tree Algorithm | tutorialspoint Prim’s Spanning Tree Algorithm | tutorialspoint


In practice, quicksort outperforms merge sort, and it significantly outperforms selection sort and insertion sort. The average-case running time of quicksort is as good as mergesort’s. That’s because the constant factor hidden in the big-Θ notation for quicksort makes mergesort quite faster than mergesort. Not using additional storage. pivot, split point Example References Overview of quicksort | […]