LICENSE
Deep Learning Tutorials
Getting Started
Datasets
Notation
A Primer on Supervised Optimization for Deep Learning
Theano/Python Tips
Classifying MNIST digits using Logistic Regression...
分类:
其他好文 时间:
2014-06-05 03:05:05
阅读次数:
210
Finding Nemo
Time Limit: 2000MS
Memory Limit: 30000K
Total Submissions: 7373
Accepted: 1715
Description
Nemo is a naughty boy. One day he went into the deep sea all b...
分类:
其他好文 时间:
2014-06-03 03:04:50
阅读次数:
348
Finding NemoTime Limit: 2000MSMemory Limit:
30000KTotal Submissions: 7376Accepted: 1717DescriptionNemo is a naughty boy. One
day he went into the deep...
分类:
其他好文 时间:
2014-06-01 12:23:25
阅读次数:
200
A linked list is given such that each node
contains an additional random pointer which could point to any node in the list
or null.Return a deep copy ...
分类:
其他好文 时间:
2014-05-30 15:07:49
阅读次数:
260
Finding NemoTime Limit: 2000MSMemory Limit:
30000KTotal Submissions: 7372Accepted: 1714DescriptionNemo is a naughty boy. One
day he went into the deep...
分类:
其他好文 时间:
2014-05-29 09:36:17
阅读次数:
355
在以下文章中,UNDERSTANDING HOW DEEP BELIEF NETWORKS
PERFORM ACOUSTIC MODELLINGAbdel-rahman Mohamed, Geoffrey Hinton, and Gerald
PennDepartment of Computer S...
分类:
其他好文 时间:
2014-05-26 17:32:36
阅读次数:
201
该文章发表在CVPR2013上,主要讲述了如何利用深度卷积网实现人脸特征点的位置预测,个人认为本文最大的亮点在于巧妙地将神经元的输出和坐标值联系起来,实现了多点位置预测。从作者的结果来看,似乎该方法可以秒杀其他任何面部特征点检测算法,具体是不是这样,还需要广大童鞋去验证。...
分类:
其他好文 时间:
2014-05-25 04:26:42
阅读次数:
369
ExpeditionTime Limit: 1000MSMemory Limit: 65536KDescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately manag...
分类:
其他好文 时间:
2014-05-22 06:16:01
阅读次数:
423
浅复制:浅复制(浅拷贝,指针拷贝,shallow copy),源对象和副本对象是同一个对象,
源对象(副本对象)引用计数器 + 1, 相当于做一次retain操作。本质是:没有产生新的对象深复制:(深拷贝,内容拷贝,deep
copy),源对象和副本对象是不同的两个对象,源对象引用计数器不变...
分类:
其他好文 时间:
2014-05-21 05:09:36
阅读次数:
301
A linked list is given such that each node
contains an additional random pointer which could point to any node in the list
or null.Return a deep copy ...
分类:
其他好文 时间:
2014-05-19 15:50:28
阅读次数:
447