排序:
默认
按更新时间
按访问量

Caffe编译Bug

这次在编译Caffe的过程中,出现了imread以及imencode的bug,具体部分如下:.build_release/lib/libcaffe.so: undefined reference to `cv::imencode(std::__cxx11::basic_string<char...

2017-11-26 20:25:43

阅读数:127

评论数:0

Pytorch框架下Finetune注意点

最近在参加AI challenger的比赛(虽然九月就开始的比赛,到11月才开始玩。。。)结局无所谓,就希望在过程中能学习一些东西,由于场景识别比赛的finetune模型权重都是torch下的,之前尝试了很多权重转化工具,但是发现基本上都不靠谱,所以比赛要继续做下去,只能转向Pytorch,花了整...

2017-11-20 16:41:29

阅读数:5170

评论数:0

1×1卷积功能

之前对1×1卷积的作用的看法主要是多通道融合和降低feature map数量,最近又看到一个新说法,记录一下: 转自:http://finance.jrj.com.cn/tech/2017/07/07185122717460.shtml?utm_source=tuicool&utm_me...

2017-07-10 10:58:34

阅读数:740

评论数:0

深度学习资料整理

研一到现在收集了深度学习方面大量的博客和资料,主要都是网页的,也有很多有意思的code,抽空一起整理了一下,这几天慢慢放出来,资料我会分类,代码放在资料之后,下面就开始吧!

2017-05-04 22:40:16

阅读数:2579

评论数:0

112. 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 s...

2017-04-08 12:22:45

阅读数:281

评论数:0

130. Surrounded Regions

题意: Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.A region is captured by flipping all ‘O’s into ‘X’s...

2017-04-06 22:51:10

阅读数:185

评论数:0

207. Course Schedule

题意: There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you ha...

2017-04-04 13:44:43

阅读数:188

评论数:0

10. Regular Expression Matching

题意:Implement regular expression matching with support for ‘.’ and ‘*’.'.' Matches any single character. '*' Matches zero or more of the preceding ele...

2017-03-15 20:48:16

阅读数:168

评论数:0

279. Perfect Squares

题意: Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.For example, given n = 1...

2017-03-14 20:52:17

阅读数:198

评论数:0

322. Coin Change

题意: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that yo...

2017-03-12 15:26:47

阅读数:230

评论数:0

221. Maximal Square

题意: Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.For example, given the followin...

2017-03-12 13:43:21

阅读数:216

评论数:0

213. House Robber II

题意:After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. Th...

2017-03-11 13:45:20

阅读数:124

评论数:0

198. House Robber

题意:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stoppin...

2017-03-10 23:08:50

阅读数:116

评论数:0

64. 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 pa...

2017-03-07 22:18:57

阅读数:126

评论数:0

152. Maximum Product Subarray

题意: Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,...

2017-03-06 20:27:34

阅读数:122

评论数:0

63. Unique Paths II

题意:Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty spa...

2017-03-06 20:12:13

阅读数:123

评论数:0

63. Unique Paths II

题意:Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty spa...

2017-03-06 17:00:53

阅读数:143

评论数:0

62. Unique Paths

题意:A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at ...

2017-03-06 15:14:01

阅读数:170

评论数:0

70. Climbing Stairs

题意:You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you...

2017-03-05 14:40:13

阅读数:111

评论数:0

102. Binary Tree Level Order Traversal

题意:Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tr...

2017-02-25 21:49:49

阅读数:101

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭