2015年11月_susandebug

12月 11月 10月 09月 08月 07月 06月 03月

原创 LeetCode题解——Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1",

2015-11-27 15:28:29 400

转载 caffe运行时的bug

1. 安装.deb文件，用sudo gdebi XXX.debsudo apt-get install xxx2.需要配置系统路径：LD_LIBRARY_PATH=.../lib:LD_LIBRARY_PATHexportLD_LIBRARY_PATH3.ln -sf xxx xxx软链接4. Training LeNet onMNIST w

2015-11-26 15:11:49 4860 2

原创 Caffe中learning rate 和 weight decay 的理解

Caffe中learning rate 和 weight decay 的理解在caffe.proto中对caffe网络中出现的各项参数做了详细的解释。1.关于learning rate optional float base_lr = 5; // The base learning rate // The learning rate decay policy. The cur

2015-11-26 14:59:47 31789 1

转载随机梯度下降（Stochastic gradient descent）和批量梯度下降（Batch gradient descent ）

梯度下降（GD）是最小化风险函数、损失函数的一种常用方法，随机梯度下降和批量梯度下降是两种迭代求解思路，下面从公式和实现的角度对两者进行分析，如有哪个方面写的不对，希望网友纠正。下面的h(x)是要拟合的函数，J(theta)损失函数，theta是参数，要迭代求解的值，theta求解出来了那最终要拟合的函数h(theta)就出来了。其中m是训练集的记录条数，j是参数的个数。

2015-11-23 15:16:54 1097

转载 LeNet -5 卷积神经网络的网络结构

卷积神经网络是一种特殊的多层神经网络，像其它的神经网络一样，卷积神经网络也使用一种反向传播算法来进行训练，不同之处在于网络的结构。卷积神经网络的网络连接具有局部连接、参数共享的特点。局部连接是相对于普通神经网络的全连接而言的，是指这一层的某个节点只与上一层的部分节点相连。参数共享是指一层中多个节点的连接共享相同的一组参数。一个典型的神经网络的结构是全连接的，即某一层的某个节点与上

2015-11-23 14:50:32 3323

原创 LeetCode题解——First Missing Positive

Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant

2015-11-22 19:10:36 426

原创 LeetCode题解——Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at

2015-11-18 20:36:45 424

原创 LeetCode题解——Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \

2015-11-18 19:15:24 431

原创 LeetCode题解——Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum

2015-11-17 21:55:48 454

原创 LeetCode题解——Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota

2015-11-17 21:54:36 473

转载 ImageNet Classification with Deep Convolutional Neural Network解读

ImageNet Classification with Deep Convolutional Neural Network本文是Alex和Hinton参加ILSVRC2012比赛的卷积网络论文，本网络结构也是开启Imagenet数据集更大，更深CNN的开山之作，本文对CNN的一些改进成为以后CNN网络通用的结构；在一些报告中被称为Alex-net，之后在Imagenet上取得

2015-11-16 20:16:25 1561

转载深度学习国外经典教程——大师带你入门（视频、PPT讲稿）

转自：http://baojie.org/blog/2013/01/27/deep-learning-tutorials/几个不错的深度学习教程，基本都有视频和演讲稿。附两篇综述文章和一副漫画。还有一些以后补充。Jeff Dean 2013 @ Stanfordhttp://i.stanford.edu/infoseminar/dean.pdf一

2015-11-16 15:59:05 7016

转载深度学习-LeCun、Bengio和Hinton的联合综述（下）

深度学习-LeCun、Bengio和Hinton的联合综述（下）摘要：Yann LeCun、Yoshua Bengio和Geoffrey Hinton发表于《Nature》的综述文章“Deep Learning”中文译文的下半部分，详细介绍了CNN、分布式特征表示、RNN及其不同的应用，并对深度学习技术的未来发展进行了展望。【编者按】三大牛Yann LeCun、Yosh

2015-11-16 10:55:15 1071

转载深度学习-LeCun、Bengio和Hinton的联合综述（上）

深度学习-LeCun、Bengio和Hinton的联合综述（上）摘要：最新的《Nature》杂志专门为“人工智能 + 机器人”开辟了一个专题，发表多篇相关论文，其中包括了LeCun、Bengio和Hinton首次合作的这篇综述文章“Deep Learning”。本文为该综述文章中文译文的上半部分。【编者按】三大牛Yann LeCun、Yoshua Bengio和G

2015-11-16 10:53:35 1011

转载计算机视觉的一些测试数据集和源码站点

转自：http://blog.csdn.net/zouxy09/article/details/8768561 以下是computer vision：algorithm and application计算机视觉算法与应用这本书中附录里的关于计算机视觉的一些测试数据集和源码站点，我整理了下，加了点中文注解。ComputerVision:Algorith

2015-11-11 08:54:25 628

原创 LeetCode题解——Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe

2015-11-08 21:57:04 447

原创 LeetCode题解——Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1

2015-11-08 21:20:33 449

原创 LeetCode题解——Basic Calculator

The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces .You may assume that the given expression is always valid

2015-11-08 17:20:32 587

原创 LeetCode题解——Different Ways to Add Parentheses

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *.Example 1I

2015-11-08 11:29:12 568

原创 LeetCode题解——Unique Binary Search Trees II

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3

2015-11-07 22:45:27 557

原创 LeetCode题解——Unique Binary Search Trees

题目：Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1

2015-11-07 20:47:31 447

原创 LeetCode题解——Symmetric Tree

题目：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But th

2015-11-06 14:19:02 416

转载使用rand5()生成rand7()

给你一个能生成1到5随机数的函数，用它写一个函数生成1到7的随机数。 (即，使用函数rand5()来实现函数rand7())。解答rand5可以随机生成1,2,3,4,5；rand7可以随机生成1,2,3,4,5,6,7。 rand5并不能直接产生6，7，所以直接用rand5去实现函数rand7似乎不太好入手。如果反过来呢？给你rand7，让你实现rand5，这个好实现吗？

2015-11-05 21:10:00 22004 9

原创 LeetCode题解——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 of the list.Subscribe to see which com

2015-11-03 21:11:27 479

原创 LeetCode题解——Binary Search Tree Iterator

mplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next()

2015-11-03 18:36:10 421

原创 LeetCode题解——Reverse Words in a String

Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Try to solve it in-place in O(1) space.Clarification:W

2015-11-03 17:05:06 442