search for: sum_1

Displaying 3 results from an estimated 3 matches for "sum_1".

Did you mean: sum1
2008 Feb 04
0
[LLVMdev] Question to Chris
...>> is, but I have no good ability that I can explain it in this plain >> text space. > >Let me rephrase your question for you. You can then see the right >question, and the answer for it. > >The question is, why is, why can't I change: > > bb8: > sum_1 = i_0_pn + sum_0_pn; > br bool %exitcond, label %bb10, label %bb3 > >into > > bb8: > br bool %exitcond, label %bb10, label %bb3 > sum_1 = i_0_pn + sum_0_pn; > >? > >The answer is, because that is an invalid transform. > > A: > B; >...
2008 Feb 02
4
[LLVMdev] Question to Chris
Dear Prof.Adve and Bill, I deeply appreciate your comments and concerns. (Please forgive my late response. I've tried some more cases to make this issue) As Prof.Adve mentioned, I need to explain exactly what my problem is, but I have no good ability that I can explain it in this plain text space. For this reason, I made a .pdf file and linked it as follows:
2001 Jun 05
1
11.82 bpw clarification (was Re: ssh-keygen(1) misinfo: English prose entropy 0.6 - 1.3 b/char!)
...hly p_n = 0.1/n . Zipf has pointed out that this type of formula, p_n = k/n, gives a rather good approximation to the word probabilities in many different languages. The formula [above] clearly can not hold indefinitely since the total probablility SUM p_n must be unity, while SUM_1^inf 0.1/n is infinite. If we assume (in the absence of any better estimate) that the formula p_n = 0.1/n holds out to the n at which the total probability is unity, and that p_n = 0 for larger n; we find that the critical n is the word rank 8,727. The entropy is then: -SUM_1^8727 p_n log_2 p_...