- 博客(18)
- 资源 (9)
- 收藏
- 关注
转载 哈尔小波变换的原理及其实现(Haar)
Haar小波在图像处理和数字水印等方面应用较多,这里简单的介绍一下哈尔小波的基本原理以及其实现情况。 一、Haar小波的基本原理 数学理论方面的东西我也不是很熟悉,这边主要用简单的例子来介绍下Haar小波的使用情况。 例如:有a=[8,7,6,9]四个数,并使用b[4]数组来保存结果. 则一级Haar小波变换的结果为:
2015-12-30 16:32:48 17354
转载 (三)卷积递归深度学习在3D物体分类中的应用(译文)
卷积递归深度学习在3D物体分类中的应用(Convolutional-Recursive Deep Learning for 3D Object Classification)Richard Socher, Brody Huval, Bharath Bhat, Christopher D. Manning, AndrewY. NgComputer Science Department,
2015-12-30 14:13:22 2965
转载 (二)卷积神经网络
转载:http://blog.csdn.net/stdcoutzyx/article/details/41596663自今年七月份以来,一直在实验室负责卷积神经网络(Convolutional Neural Network,CNN),期间配置和使用过theano和cuda-convnet、cuda-convnet2。为了增进CNN的理解和使用,特写此博文,以其与人交流,互有增益。正文之前,
2015-12-30 14:05:25 633
转载 (一)神经网络编程入门
转自:http://www.cnblogs.com/heaad/archive/2011/03/07/1976443.html 本文主要内容包括: (1) 介绍神经网络基本原理,(2) AForge.NET实现前向神经网络的方法,(3) Matlab实现前向神经网络的方法 。第0节、引例 本文以Fisher的Iris数据集作为神经网络程序的测
2015-12-20 10:23:35 664
转载 java 链表基本操作
import java.util.HashMap; import java.util.Scanner; import java.util.Stack; /** * * @author kerryfish * 关于java中链表的操作 * 1. 求单链表中结点的个数: getListLength * 2. 将单链表反转: reverseList(遍历),re
2015-12-16 11:18:01 561
原创 LeetCode:Longest Common Prefix
问题描述:Write a function to find the longest common prefix string amongst an array of strings.思路:以第一个模板,按照一位一位去比较即可。代码:public class Solution { public String longestCommonPrefix(String[] s
2015-12-16 10:39:41 261
原创 java 中容易混淆的知识点
一、java集合求长度 数组 s.length 数组获得是length属性,而不是方法!!!字符串 s.length()字符串数组 s.lengthlist list.size();map map.size();set set.size();二、java字符串
2015-12-16 09:51:44 396
原创 LeetCode:Remove Nth Node From End of List
问题描述: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 t
2015-12-11 16:41:53 249
原创 LeetCode:Excel Sheet Column Number
问题描述:Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3
2015-12-11 12:04:31 352
原创 java apache POI操作Excel的一些小技巧
最近在开发一个处理数据的程序,期间需要对单元格的缓存值进行处理,在网上找到一些资料,自己尝试着实现下。一、Apache-POI操作Excel将合并后的单元格全部填充为相同数据的一个实例。private static void fillMergedRegion(final Sheet sheet) { for (int i = 0; i < sheet.getNumMergedReg
2015-12-11 11:12:43 420
原创 LeetCode:Happy Number
问题描述:Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of
2015-12-10 12:08:54 248
原创 LeetCode:Merge Two Sorted Lists
问题描述: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.思路:按照从小到大的顺序排列,最关键的指针是*cur,保存最后链表的方向,还有p、q两个
2015-12-09 16:36:33 293
原创 LeetCode:Isomorphic Strings
问题描述:Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replace
2015-12-09 13:52:33 298
原创 LeetCode:Palindrome Number
问题描述:Determine whether an integer is a palindrome. Do this without extra space.思路:1、求出位数;2、取出数的第一位和最后一位比较,若相同,将第一位和最后一位同时去掉,然后将base维度降低100,再比较新数的头尾,如此循环下去;如果不等,直接返回false。代码:代码1class Solu
2015-12-09 12:04:17 309
原创 LeetCode:Count Primes
问题描述:Count the number of prime numbers less than a non-negative number, n.返回n之前所有素数的个数。思路:朴素算法代码1显然不满足,初始想法就是朴素算法,没有通过,代码2为埃拉托斯特尼筛法,可以AC。代码1:初始想法:class Solution {public: int countPr
2015-12-09 10:25:10 295
原创 LeetCode:Valid Sudoku
问题描述:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A part
2015-12-08 15:31:13 270
原创 LeetCode:ZigZag Conversion
一、问题描述The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H
2015-12-04 16:12:47 244
原创 LeetCode:Contains Duplicate
一、问题描述Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every
2015-12-04 13:19:30 338
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人