码迷,mamicode.com
首页 >  
搜索关键字:finding    ( 259个结果
Finding the Right Consumer: Optimizing for Conversion in Display Advertising Campaigns
这周在公司分享会上分享了《Finding the Right Consumer: Optimizing for Conversion in Display Advertising Campaigns》,下面贴出分享的主要内容。     文章参考于:http://www.cs.cmu.edu/~yandongl/papers/wsdm2012.pdf...
分类:其他好文   时间:2015-01-18 15:47:28    阅读次数:185
大数据之道 HMM系列
一:HMM解码问题 (1)给定一个观察序列O=O1O2...OT,和模型μ=(A,B,π),如何快速有效地选择在一定意义下“最优”的状态序列Q=q1q2...qT,使该状态最好地解释观察序列。 (2)最可能的隐藏状态序列(Finding most probable sequence of hidden states);对于一个特殊的隐马尔科夫模型(HMM)及一个相应的观察序列,我们常常希望能找...
分类:其他好文   时间:2015-01-16 13:11:21    阅读次数:232
Selection in expected linear time O(n)
Selection in expected linear time            The general selection problem appears more difficult than the simple problem of finding a minimum. Yet, surprisingly, the asymptotic running tim...
分类:其他好文   时间:2015-01-15 14:21:23    阅读次数:185
[ACM] POJ 3740 Easy Finding (DFS)
Easy Finding Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16482   Accepted: 4476 Description Given a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), co...
分类:其他好文   时间:2015-01-14 11:08:52    阅读次数:189
POJ 2049-Finding Nemo(三维bfs解决类迷宫问题)
Finding Nemo Time Limit: 2000MS   Memory Limit: 30000K Total Submissions: 7902   Accepted: 1827 Description Nemo is a naughty boy. One day he went into the deep sea all...
分类:其他好文   时间:2015-01-08 15:25:22    阅读次数:164
九度OJ—题目1094:String Matching
题目描述:     Finding all occurrences of a pattern in a text is a problem that arises frequently in text-editing programs.     Typically,the text is a document being edited,and the pattern searched f...
分类:其他好文   时间:2015-01-03 11:59:34    阅读次数:157
九度OJ 1094 String Matching
题目1094:String Matching 时间限制:1 秒 内存限制:32 兆 特殊判题:否 提交:1098 解决:587 题目描述:     Finding all occurrences of a pattern in a text is a problem that arises frequently in text-editin...
分类:其他好文   时间:2015-01-01 07:54:41    阅读次数:217
Best Time to Buy and Sell Stock II
Algorithm: Scan through the array, keep finding 1. prices[i] with the condition: prices[i] prices[i+1], or at the end of an ascending trend, trea...
分类:其他好文   时间:2014-12-31 06:16:24    阅读次数:159
poj1200 哈希
http://poj.org/problem?id=1200 Description Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. ...
分类:其他好文   时间:2014-12-29 10:28:57    阅读次数:234
Manacher处理回文的方法
这里,我介绍一下O(n)回文串处理的一种方法。Manacher算法.原文地址:http://zhuhongcheng.wordpress.com/2009/08/02/a-simple-linear-time-algorithm-for-finding-longest-palindrome-sub-...
分类:其他好文   时间:2014-11-26 18:38:27    阅读次数:167
259条   上一页 1 ... 20 21 22 23 24 ... 26 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!