HyperNet: Towards Accurate Region Proposal Generation
and Joint Object Detection
本篇论文发表于2016 IEEE Conference on Computer Vision and Pattern Recognition
论文下载地址：
http://ieeexplore.ieee.org/document/7780467/

在这里总结一下线性回归逻辑回归和更一般的回归模型。

CNN-RNN: A Unified Framework for Multi-label ImageClassification

这是一篇我发在我们实验室公众号的组会论文解读。
http://mp.weixin.qq.com/s?__biz=MzU2MTAyMDI5Nw==&mid=2247483695&idx=1&sn=7cb2a31072c1d315cbbb24d205b0d581&chksm=fc7e6dc9cb09e4df554c723b687924e3e83a2d015ca18c577343f8f69a90c760f03f4211c658&mpshare=1&scene=23&srcid=0327nQuAyoWcgrTbccFgeqsA#rd

名词区分：

Multi-label Image Classification：给出一张图片，只需指出图片中所有物体即可。

object detection：给出一张图片，要求指出所有物体和其位置。

该篇论文使用了一个同一个CNN-RNN框架来进行图像多标签分类。发表于cvpr 2016.
下载地址：
http://ieeexplore.ieee.org/document/7780620/

id53. Maximum Subarray Add to List
Description Submission Solutions
Total Accepted: 169989
Total Submissions: 436088
Difficulty: Easy
Contributors: Admin
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

1. Longest Valid Parentheses Add to List
   Description Submission Solutions
   Total Accepted: 86398
   Total Submissions: 374225
   Difficulty: Hard
   Contributors: Admin
   Given a string containing just the characters ‘(‘ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.
   阅读全文 »

1. Longest Palindrome Add to List
   Description Submission Solutions
   Total Accepted: 28693
   Total Submissions: 64338
   Difficulty: Easy
   Contributors: Admin
   Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.

This is case sensitive, for example “Aa” is not considered a palindrome here.

1. Generate Parentheses Add to List
   Description Submission Solutions
   Total Accepted: 129826
   Total Submissions: 305733
   Difficulty: Medium
   Contributors: Admin
   Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
   阅读全文 »

id21. Merge Two Sorted Lists Add to List QuestionEditorial Solution My Submissions
Total Accepted: 185619
Total Submissions: 488183
Difficulty: Easy
Contributors: Admin
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

id20. Valid Parentheses Add to List QuestionEditorial Solution My Submissions
Total Accepted: 163285
Total Submissions: 507096
Difficulty: Easy
Contributors: Admin
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.

The brackets must close in the correct order, “()” and “()[]{}” are all valid but “(]” and “([)]” are not.

id19. Remove Nth Node From End of List Add to List QuestionEditorial Solution My Submissions
Total Accepted: 154617
Total Submissions: 480607
Difficulty: Easy
Contributors: Admin
Given a linked list, remove the nth node from the end of list and return its head.

For example,

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Try to do this in one pass.