- 博客(30)
- 资源 (2)
- 收藏
- 关注
原创 Getting Started with TensorFlow
An organization for the get_start of tensorFlow - https://www.tensorflow.org/get_started/get_started
2017-05-25 13:03:20
483
原创 How to improve neural networks learning
http://neuralnetworksanddeeplearning.com/chap3.html#overfitting_and_regularization
2017-05-22 14:46:26
402
原创 How back-Propagation works
machine learning, deep learning, back-propagation, bp
2017-05-19 17:48:48
410
原创 JavaScript - This
Javascript: introduction to this identifier and object prototypes
2016-11-07 14:35:24
365
原创 Proving local minimal to be global minimal in Convex optimization
convex optimization
2016-09-09 19:48:22
375
原创 Puzzle - Light Bulb Switching
Light Bulb Switching TeaserFind the bulbs that are still on.
2016-04-19 22:07:51
373
原创 Regular Expressions in Python with re module
Regular expression used in python with re module
2016-02-23 21:59:50
1015
原创 Matching Game based on JS
Using JavaScript to realize a matching game in web browse.
2015-12-23 10:33:44
542
原创 Regular Expression - Posix
1. Character Class[:alnum:] // match number[:alpha:] // match char[:lower:] // match lower case char[:upper:] // match upper case char[:digit:] // match float[:xdigit:] /
2015-12-18 21:52:52
415
原创 Python Beginner
Python is an implicit type language, which means you don't need to declare a type for the variable, only you need to do is giving a variable a value, the python knows what's type it is.
2015-12-18 14:03:50
1127
原创 ShellSort
The idea of Shellsort is moving entries more than one position at a time by h-sorting the array.h = 4 L E E A M H L E P S O L T S X R L —— M —— P —— T E —— H —— S —— S E —— L ——
2015-11-30 16:56:51
328
原创 Insertion sort
Java Implementationpublic class Insertion{ public static void sort(Comparable[] a) { int N = a.length; for (int i = 0; i < N; i++) { for (int j=i; j>0; j--)
2015-11-30 16:23:16
286
原创 Selection sort
Java implementation:public class Selection{ public static void sort(Comparable[] a) { int N = a.length; for (int i = 0; i < N; i++){ int min = i; for (int j = i+1; j<N
2015-11-30 15:58:01
372
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人