<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[A_bigUncle的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/A_bigUncle</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; A_bigUncle]]></copyright><item><title><![CDATA[Ideas For Weakly Supervised Object Localization]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/98787661</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/98787661</guid><author>A_bigUncle</author><pubDate>Wed, 07 Aug 2019 21:54:22 +0800</pubDate><description><![CDATA[Ideas For Weakly Supervised Object Localization
最近开始跟着师兄做弱监督学习和医疗影像，近日阅读了几篇文章，与 Object Localization 相关，它们都是基于 Learning Deep Features for Discriminative Localization 这篇文章提出的 class activation maps (CAM)...]]></description><category></category></item><item><title><![CDATA[Log-Sum-Exp Pooling]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/98596268</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/98596268</guid><author>A_bigUncle</author><pubDate>Tue, 06 Aug 2019 10:59:40 +0800</pubDate><description><![CDATA[Log-Sum-Exp Pooling
Papers

From Image-level to Pixel-level Labeling with Convolutional Networks
ChestX-ray8: Hospital-scale Chest X-ray Database and Benchmarks on Weakly-Supervised Classiﬁcation and ...]]></description><category></category></item><item><title><![CDATA[ColorSketch]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/96430360</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/96430360</guid><author>A_bigUncle</author><pubDate>Thu, 18 Jul 2019 14:35:07 +0800</pubDate><description><![CDATA[ColorSketch

“ColorSketch: A Drawing Assistant for Generating Color Sketches from Photos”

前言
拿到这篇文章的时候，我还是很惊喜的。因为之前很少阅读应用或者工程相关的论文，借着这次机会，看看是否能让自己的科研思路转变转变，不做一个一直改模型发Paper的机器。在我看来，很多地方都能让人眼前一亮，之前在计算机...]]></description><category></category></item><item><title><![CDATA[Capacity Facility Location Problem]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/85220541</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/85220541</guid><author>A_bigUncle</author><pubDate>Sun, 23 Dec 2018 09:47:24 +0800</pubDate><description><![CDATA[文章目录Capacity Facility Location ProblemCFLP方案贪心算法局部搜索法模拟退火效果代码贪心算法局部搜索模拟退火目前最优解
Capacity Facility Location Problem
CFLP
Capacity Facility Location Problem，即有容量限制的设施选址问题，更准确地说，这次解决的问题为 SSCFLP（Single Sou...]]></description><category></category></item><item><title><![CDATA[[Week 14] LeetCode 23. Merge k Sorted Lists]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/84930454</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/84930454</guid><author>A_bigUncle</author><pubDate>Sun, 09 Dec 2018 18:42:27 +0800</pubDate><description><![CDATA[LeetCode 23. Merge k Sorted Lists
问题描述
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Example
Input:
[
  1-&amp;amp;gt;4-&amp;amp;gt;5,
  1-&amp;amp;gt;3-&amp;amp;gt;4,
  2-&amp;amp;gt;6
]...]]></description><category></category></item><item><title><![CDATA[[Week 13] LeetCode 338. Counting Bits]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/84726724</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/84726724</guid><author>A_bigUncle</author><pubDate>Sun, 02 Dec 2018 19:33:17 +0800</pubDate><description><![CDATA[LeetCode 338. Counting Bits
问题描述
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an ...]]></description><category></category></item><item><title><![CDATA[[Week 11] LeetCode 403. Frog Jump]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/84203120</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/84203120</guid><author>A_bigUncle</author><pubDate>Sun, 18 Nov 2018 18:46:32 +0800</pubDate><description><![CDATA[LeetCode 403. Frog Jump
问题描述
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into ...]]></description><category></category></item><item><title><![CDATA[[Week 10] LeetCode 32. Longest Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/83902697</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/83902697</guid><author>A_bigUncle</author><pubDate>Fri, 09 Nov 2018 20:04:44 +0800</pubDate><description><![CDATA[LeetCode 32. Longest Valid Parentheses
问题描述
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
示例
Example 1
Input: &amp;quot;((...]]></description><category></category></item><item><title><![CDATA[[Week 9] LeetCode 72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/83717526</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/83717526</guid><author>A_bigUncle</author><pubDate>Sun, 04 Nov 2018 17:01:48 +0800</pubDate><description><![CDATA[LeetCode 72. Edit Distance
问题描述
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
You have the following 3 operations permitted on a word:

Ins...]]></description><category></category></item><item><title><![CDATA[Travis CI - golang]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/83660713</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/83660713</guid><author>A_bigUncle</author><pubDate>Fri, 02 Nov 2018 20:01:47 +0800</pubDate><description><![CDATA[Travis CI - golang

What is Continuous Integration (CI) ?
Continuous Integration is the practice of merging in small code changes frequently - rather than merging in a large change at the end of a dev...]]></description><category></category></item><item><title><![CDATA[[Week 8] LeetCode 300. Longest Increasing Subsequence]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/83476245</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/83476245</guid><author>A_bigUncle</author><pubDate>Sun, 28 Oct 2018 17:14:05 +0800</pubDate><description><![CDATA[LeetCode 300. Longest Increasing Subsequence
问题描述
Given an unsorted array of integers, find the length of longest increasing subsequence.
Example
Input: [10,9,2,5,3,7,101,18]
Output: 4 
Explanation: T...]]></description><category></category></item><item><title><![CDATA[[Week 7] LeetCode 45 & 55. Jump Game I & II]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/83215720</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/83215720</guid><author>A_bigUncle</author><pubDate>Sat, 20 Oct 2018 18:33:34 +0800</pubDate><description><![CDATA[LeetCode 45 &amp;amp; 55. Jump Game I &amp;amp; II
Jump Game I
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your ...]]></description><category></category></item><item><title><![CDATA[[Week 6] LeetCode 4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/83048502</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/83048502</guid><author>A_bigUncle</author><pubDate>Sun, 14 Oct 2018 16:47:47 +0800</pubDate><description><![CDATA[LeetCode 4. Median of Two Sorted Arrays
问题描述
There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should ...]]></description><category></category></item><item><title><![CDATA[[Week 5] LeetCode 854. K-Similar Strings]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82960409</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82960409</guid><author>A_bigUncle</author><pubDate>Sun, 07 Oct 2018 19:26:00 +0800</pubDate><description><![CDATA[LeetCode 854. K-Similar Strings
问题描述：
Strings A and B are K-similar (for some non-negative integer K) if we can swap the positions of two letters in A exactly K times so that the resulting string equa...]]></description><category></category></item><item><title><![CDATA[[Week 4] LeetCode 743. Network Delay Time]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82884963</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82884963</guid><author>A_bigUncle</author><pubDate>Fri, 28 Sep 2018 15:39:08 +0800</pubDate><description><![CDATA[LeetCode 743. Network Delay Time
问题描述：
There are N network nodes, labelled 1 to N.
Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the targ...]]></description><category></category></item><item><title><![CDATA[Golang 入门与配置]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82868250</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82868250</guid><author>A_bigUncle</author><pubDate>Thu, 27 Sep 2018 15:42:47 +0800</pubDate><description><![CDATA[Golang 入门与配置
Golang

Go（又称Golang）是Google开发的一种静态强类型、编译型、并发型，并具有垃圾回收功能的编程语言。
罗伯特·格瑞史莫，罗勃·派克（Rob Pike）及肯·汤普逊于2007年9月开始设计Go，稍后Ian Lance Taylor、Russ Cox加入项目。Go是基于Inferno操作系统所开发的。Go于2009年11月正式宣布推出，成为开放源代码项目...]]></description><category></category></item><item><title><![CDATA[[Week 3] LeetCode 785. Is Graph Bipartite?]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82810237</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82810237</guid><author>A_bigUncle</author><pubDate>Sat, 22 Sep 2018 10:12:11 +0800</pubDate><description><![CDATA[LeetCode 785. Is Graph Bipartite?
问题描述：
Given an undirected graph, return true if and only if it is bipartite.
Recall that a graph is bipartite if we can split it’s set of nodes into two independent s...]]></description><category></category></item><item><title><![CDATA[[Week 2] LeetCode 335. Count of Smaller Numbers After Self]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82714483</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82714483</guid><author>A_bigUncle</author><pubDate>Sat, 15 Sep 2018 15:36:31 +0800</pubDate><description><![CDATA[LeetCode 335. Count of Smaller Numbers After Self

问题描述：

You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number...]]></description><category></category></item><item><title><![CDATA[使用VirtualBox搭建私有云]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82562142</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82562142</guid><author>A_bigUncle</author><pubDate>Sun, 09 Sep 2018 20:54:55 +0800</pubDate><description><![CDATA[使用VirtualBox让PC提供云桌面服务



前言

本教程大部分参考潘老师 课程网站 上给的教程，总结了一下我安装过程中遇到的问题，提供给有相同问题的童鞋作参考。

安装VirtualBox


官方下载
安装Oracle VirtualBox 5.x 
注意：我在安装的时候会提示说安装虚拟网卡，会停用网络balabala的，嗯，然后我就一直卡在那里了；解决方案是安装前先停用本机网络
Vi...]]></description><category></category></item><item><title><![CDATA[[Week 1] LeetCode 215. Kth Largest Element in an Array]]></title><link>https://blog.youkuaiyun.com/A_bigUncle/article/details/82533401</link><guid>https://blog.youkuaiyun.com/A_bigUncle/article/details/82533401</guid><author>A_bigUncle</author><pubDate>Sat, 08 Sep 2018 22:19:20 +0800</pubDate><description><![CDATA[LeetCode 215. Kth Largest Element in an Array

问题描述：

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

输入示...]]></description><category></category></item></channel></rss>