Introduction Conditional version of Generative Adversarial Nets (GAN) where both generator and discriminator are conditioned on some data y (class label or data from some other modality). Architecture Feed y into both the generator and discriminator as additional input layers such that y and input are combined in a joint hidden representation.
1. Markov Process / Markov chain 1.1. Markov process A Markov process or Markov chain is a tuple such that is a finite set of states, and is a transition probability matrix. In a Markov process, the initial state should be given. How do we choose the initial state is not a role of the Markov process. 1.2. State […]
References A Survival Guide to a PhD. Andrej Karpathy blog. Sep 7, 2016 [LINK] HOWTO: Get into grad school for science, engineering, math and computer science [LINK] 대학원생을 위한 지극히 개인적인 10가지 조언 [LINK] 논문 읽기 초보자를 위한 Literature survey (문헌 조사) 팁! [LINK] 석사와 박사 [LINK] 내가 대학원에서 생존한 방법 [LINK] 박사 과정을 통해 배운 것들 […]
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 […]
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]
Autoregressive Models An autoregressive model is a regression where that a value from a time series is regressed on previous values from that same time series. The order of an autoregression is the number of immediately preceding values in the series that are used to predict the value at the present time. A first-order autoregression[=autoregressive […]
References 이정모 (2009) 『인지과학: 학문 간 융합의 원리와 응용』. 성균관대학교출판부. pp.443-450 이애영 (2013) 기억의 분류와 담당 뇌구조. 『2013년 대한신경과학회 제32차 학술대회 강의록』. pp.203-208
Install Caffe on Linux Ubuntu 16.04 My Configurations Linux: Ubuntu 16.04 LTS Anaconda: Anaconda 2 (64-bit), Anaconda2-4.3.0-Linux-x86_64.sh CPU or GPU: CPU Install Caffe 1. Install CUDA 8 (Optional. I failed this installation.) Go to the CUDA download page(https://developer.nvidia.com/cuda-downloads). ‘ Go to the directory where the downloaded file cuda_8.0.44_linux.run is located.
$ sudo sh cuda_8.0.44_linux.run
Installing the NVIDIA display driver...
It appears that an X server is running. Please exit X before installation. If you're sure that X is not running, but are getting this error, please delete any X lock files in /tmp.
= Summary =
Driver: Installation Failed
Toolkit: Installation skipped
Samples: Installation skipped
I got an error. http://askubuntu.com/questions/149206/how-to-install-nvidia-run Hit CTRL+ALT+F1 […]
A heap is a data structure in the form of a balanced binary tree with a special constraint that will be introduced in the followings. In the tree, each node contains a key and two references to two child nodes. The key represents a value, which is normally an integer since every data type in […]
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