shuaijiang's blog
  • 首页
  • 归档
  • 分类
  • 标签
  • 关于

基于深层神经网络的语音合成

简介随着深度学习在各个领域取得了优异的性能,例如计算机视觉、自然语言处理领域。深度学习也被应用到语音合成中,并取得了不错的效果。本文就简单介绍基于深层神经网络的语音合成。 基于DBN的语音合成深层置信网络(Deep Neural Network,DBN)是概率生成模型,其中包含了多个隐层。 基于DNN的语音合成深层神经网络(Deep Neural Network,DNN)是一种前馈神经网络,除了
4月 21 2016
#语音合成 #机器学习

LeetCode Word Search 2

DescriptionGiven a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters of sequentially adjacent cell, where “adjacent” cells are t
10月 21 2015
#leetcode

LeetCode Restore IP Addresses

DescriptionGiven a string containing only digits, restore it by returning all possible valid IP address combinations. For example:Given “25525511135”, return [“255.255.11.135”, “255.255.111.35”]. (Ord
10月 20 2015
#leetcode

LeetCode Count Primes

DescriptionCount the number of prime numbers less than a non-negative number, n. The original problem is here. The original code is here.
10月 20 2015
#leetcode

LeetCode Implement Trie Prefix Tree

DescriptionImplement a trie with insert, search, and startsWith methods. Note:You may assume that all inputs are consist of lowercase letters a-z. The original problem is here. The original code is he
10月 19 2015
#leetcode

LeetCode Bitwise AND of Numbers Range

DescriptionGiven a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. For example, given the range [5, 7], you should return 4. The
10月 19 2015
#leetcode

LeetCode Contains Duplicate 3

DescriptionGiven an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between
10月 19 2015
#leetcode

LeetCode Add And Search Word

DescriptionDesign a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing on
10月 17 2015
#leetcode

LeetCode Course Schedule2

DescriptionThere 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 have to first take course 1, which is express
10月 9 2015
#leetcode

LeetCode Move Zeros

DescriptionGiven an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after calli
9月 24 2015
#leetcode
1…34567…26

搜索

Hexo Fluid
总访问量 次 总访客数 人
京ICP证123456号 | police-icon 京公网安备12345678号