wu :: forums - Print Page


    
      
        wu :: forums
        (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi)
      

        riddles >> general problem-solving / chatting / whatever >> randomized algorithms
        
(Message started by: jennifer12345 on Apr 15^th, 2014, 9:59am)

Title: randomized algorithms
Post by jennifer12345 on Apr 15^th, 2014, 9:59am

hi guys,can some help me with this task please?
i just found this forum via google i hope its ok to post it here.
first of all my native language isnt english so bear with me you spelling nazzis out there:)
the question is this: (hopefully i'll translate it right)
we have:
M~MG(k,t) and g<t/k
find an upper bound for Pr[M<=g] by defining a binomial variable and using Chernoff bound.

i really dont know what they want from me here, and probability isnt my strongest side.... :(

Title: Re: randomized algorithms
Post by towr on Apr 15^th, 2014, 10:58am

What are M and MG ?

Title: Re: randomized algorithms
Post by rmsgrey on Apr 16^th, 2014, 6:34am

on 04/15/14 at 10:58:13, towr wrote:

What are M and MG ?

M is a random variable distributed as MG(k,t)

I have no idea what MG is though...