csx73

Hi, Thought I would mention that for me, (load "/home/timm/etc/dotemacs") didn't work

http://code.google.com/p/ourmine/wiki/LectureEval enjoy! :-) t

thanks for a great 2013- hope to see many of you in the near future. i got some brief comments about

please recall that a) to get full marks in the subject, you need 5 homeworks b) final due date for

Dr Menzies, I am currently scheduled at 6:30. However, I realized that I have another meeting that

Oh.. Thank You .. On Fri, Nov 29, 2013 at 12:08 AM, Tim Menzies <tim.m...@gmail.com> wrote:

15 minutes. offers 10 marks . meant to be a report of a completed or near completed data mining

we are close to the end, thanks for your enthusiasm now its time for the final push. 1) please

please fill in the evaluation forms for these subjects fyi, as you probably already know, i don't

Got it :) GAC On Sat, Nov 16, 2013 at 2:20 PM, Sai Ram Nellutla <sanel...@mix.wvu.edu> wrote:

dear all, sorry to say, all lectures are cancelled this week for cs310 and cs573. i knew i had a

Dr. Menzies, I have work from 5:30 to 7:30, so I wanted to come at 4:45. Can I come at 4:45? I will

Dr. Menzies, I have a doubt regarding my project -->Using TEAK on nb-tree. This is the only part I

dear all, as jason reminds us, everyone needs to hand in one page relating to their big idea. don

we need to talk more about evaluation of learners for discrete classes, see http://menzies.us/pdf/

i hereby declare that homeworks 1f 1g 1h 1i are optional so everyone gets 12 bonus marks,

maybe these will inspire some project ideas t -- :: there are some who call me... tim.menzies@gmail.

hello everyone! miss me? i missed you! i've cancelled the last homework (proj1j) and just given

Tazin, you are a genius. On Tue, Oct 8, 2013 at 1:18 PM, Tazin Afrin <taa...@mix.wvu.edu>

jason is right before the cut, we have n=n0+n1 items with mean mu after the cut we have ==> n0

Dr. Menzies, Thank you for the explanation! Especially for pointing out that bin entropy is computed

yes. the sorts will make the whole process O(n.log(n)) fyi: i say "near linear time" since,

please see http://menzies.us/cs573/?review if u have any questions please either: 1) email me 2)

-- :: there are some who call me... tim.m...@gmail.com :: prof @ cs.ai.se.csee.wvu.usa.sol.virgo.

the plan today is to go over the theory associated with the next homeworks then explore review

I said at the start of class that I would be looking to this class to find 2 research students in

.... are marked and in the box outside my room 2/15 = not ok 13/15 = ok <=== great work! from now

good news everyone- of the 10 homeworks i received last week, 9 were "ok" all are in my box

right, the "u" in uxval is for "unsupervised" t On Sat, Sep 21, 2013 at 1:50 PM,

see top-of-page for http://menzies.us/cs573/?review share & enjoy! ;-) t -- :: there are some who

in the usual place (top of http://menzies.us/cs573/?review) share & enjoy ;-) t -- :: there are

Thank you :) - Tazin On Sun, Sep 15, 2013 at 4:19 PM, Tim Menzies <tim.m...@gmail.com> wrote