Max Points on a Line题目描述：Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.解题思路：1.首先由这么一个O(n^3)的方法，也就...
分类：
其他好文 时间：
2014-11-24 15:15:28
阅读次数：
116
本文内容主要参考Steven M.Kay的《统计信号处理基础——估计与检测理论》，该书中译本分类为“国外电子与通信教材系列”，应该会有一定局限性。本文是我看过该书后的一点点总结。1.从最大似然估计看经典估计理论 最大似然估计（Maximum Likelihood Estimation，MLE）是一种...
分类：
其他好文 时间：
2014-11-23 21:37:52
阅读次数：
193
[root@openfire-x86v-app01~]#tsung-fjabber_register.xmlstartStartingTsung"Logdirectoryis:/root/.tsung/log/20141122-0639""MaximumnumberofconcurrentusersinasingleVMreachedand‘use_controller_vm‘istrue,can‘tstartnewbeam!!!Check‘maxusers‘valuein<client>conf..
分类：
其他好文 时间：
2014-11-22 18:58:51
阅读次数：
1280
Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an
ordering on the elements in V, then the bandwidth of a node
v is defined as the maximum distance in the ordering ...
分类：
其他好文 时间：
2014-11-21 23:21:51
阅读次数：
285
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the...
分类：
其他好文 时间：
2014-11-21 23:06:22
阅读次数：
242
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类：
其他好文 时间：
2014-11-21 20:23:44
阅读次数：
118
Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest ...
分类：
其他好文 时间：
2014-11-21 18:43:17
阅读次数：
196
Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest ...
分类：
其他好文 时间：
2014-11-21 18:41:59
阅读次数：
174
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类：
其他好文 时间：
2014-11-21 18:34:47
阅读次数：
167
The maximum product of sub-arrays in $[1, n]$ can be divided by 3 cases:A[n] is the maximum product of all sub-arrays in [1, n].The array which has th...
分类：
其他好文 时间：
2014-11-21 18:27:25
阅读次数：
243
