Author |
Topic: randomized algorithms (Read 2512 times) |
|
jennifer12345
Newbie
Posts: 1
|
|
randomized algorithms
« on: Apr 15th, 2014, 9:59am » |
Quote Modify
|
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....
|
|
IP Logged |
|
|
|
rmsgrey
Uberpuzzler
Gender:
Posts: 2872
|
|
Re: randomized algorithms
« Reply #2 on: Apr 16th, 2014, 6:34am » |
Quote Modify
|
on Apr 15th, 2014, 10:58am, towr wrote: M is a random variable distributed as MG(k,t) I have no idea what MG is though...
|
|
IP Logged |
|
|
|
|