码迷,mamicode.com
首页 >  
搜索关键字:deep cnn    ( 3314个结果
美国深泉学院(Deep Springs College)
这个学院有些特色。网上的介绍:http://www.deepsprings.edu/homehttp://news.mydrivers.com/1/304/304702.htmhttp://edu.qq.com/a/20110428/000006.htmhttp://news.ifeng.com/a...
分类:编程语言   时间:2014-06-06 15:12:35    阅读次数:293
五.jQuery源码解析之jQuery.extend(),jQuery.fn.extend()
给jQuery做过扩展或者制作过jQuery插件的人这两个方法东西可能不陌生. jQuery.extend([deep],target,object1,,object2...[objectN]) jQuery.fn.extend([deep],target,object1...
分类:Web程序   时间:2014-06-05 13:24:35    阅读次数:369
Deep Learning v0.1 documentation
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
poj 2049
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
[notes] ImageNet Classification with Deep Convolutional Neual Network
Paper: ImageNet Classification with Deep Convolutional Neual Network Achievements: The model addressed by Alex etl. achieved top-1 and top-5 test error rate of 37.5% and 17.0% of classifyin...
分类:Web程序   时间:2014-06-02 15:08:24    阅读次数:369
HDU - 4815 Little Tiger vs. Deep Monkey (长春赛区C题)
题意:有A,B两个人,n道题目,每题有对应的分数,B答对题目的概率是0.5,求A不输给B的概率不小于P要拿的最低分数 思路:DP,dp[i][j]来表示B答了前i题后分数为j的概率,,然后通过B的概率求A的最低分数#include #include #include #include using namespace std; const int MAXN = 40010; int a[...
分类:其他好文   时间:2014-06-02 02:25:20    阅读次数:243
Finding Nemo
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
Copy List with Random Pointer
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
poj 2049 -- Finding Nemo
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
什么是 distributed representation
在以下文章中,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
3314条   上一页 1 ... 328 329 330 331 332 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!