cs273 Google Group

Re: Lecture 21/22 or Lecture 20/21?

sati...@eecs.berkeley.edu (Satish Rao) — Thu, 02 Dec 2010 08:41:12 UT

Thanks for the question!!! Of course,
I should have been correct in the first place!
In any case, lecture 21/22 meant 20/21. Sorry for the confusion.
Lectures 22-25 are really great material (particularly the isolation lemma!),
and I would love for you to know it, but is not assigned.
Cheers,
Satish

Re: Lecture 21/22 or Lecture 20/21?

bvstraa...@lbl.gov (Brian Van Straalen) — Thu, 02 Dec 2010 04:56:44 UT

most in class have assumed that notes 20/21 are the homeworks that
bspace calls 21/22
Lecture 19/20 I think is unambiguous.
If we are wrong, we need to know, uhm... a few days ago.
Brian

Lecture 21/22 or Lecture 20/21?

erinccar...@gmail.com (Erin Carson) — Thu, 02 Dec 2010 04:47:54 UT

On the course website, there are lecture notes posted for...

Lecture 19/20
Lecture 20/21
Lecture 22
...

But on bspace, there are submission links for

Lecture 19/20
Lecture 21/22

So which questions should we answer in each submission?

Also, will we need to submit answers for lectures posted on the course

Question 1, problem 1. PARTIAL ANSWER == GOOD ENOUGH.

sati...@eecs.berkeley.edu (Satish Rao) — Thu, 02 Dec 2010 02:38:57 UT

Question on hw 19 problem 1.
The assumption is that it is a rooted tree. And each node should compute
the max distance to a descendant leaf.
If you can give an answer that computes the depth of each node ("distance
from the root) you will recieve full credit.
I think the height computation needs a rake-compress process. But

Re: Lecture 19, question 1

sati...@eecs.berkeley.edu (Satish Rao) — Thu, 02 Dec 2010 02:32:03 UT

It doesn't have to be a binary tree. But if you can do it
that way, its fine. The data structure of the tree is
then a list of children edges and a parent edge for each node. The
children edges know their place in the parents list. A high level
description
of the algorithm rather than code that deals with data structure

Re: Question 1 lecture 14

sati...@eecs.berkeley.edu (Satish Rao) — Thu, 02 Dec 2010 02:18:44 UT

Yes. Lecture 15, question 1. Sorry.
$m$ is the number of edges. You may be able to
get away with $1/m$ but $1/m^2$ should definitely
enough to keep the congestion bounds from
getting too bad. (You don't need to verify
that the congestion bounds do not worsen...but
do try to think about it.)
Satish

Lecture 19, question 1

a...@berkeley.edu (aditi) — Wed, 01 Dec 2010 23:24:51 UT

"Show how to compute the height of a node (max distance to a leaf) in
the tree using list ranking"

We're assuming that it's a binary tree, right? Are we also assuming
the same linked list structure as for the example computation of
numbering the leaves?

Question 1 lecture 14

sati...@eecs.berkeley.edu (Satish Rao) — Wed, 01 Dec 2010 21:23:58 UT

You should modify the algoirithm to stop if
every path is within (1+epsilon) of its shortest
OR the path has length less than $1/m^2$ of
the total.
The optimality condition changes slightly,
but the polynomial guarantee can be proven.
The other way it is unclear (and unknown
to me) how to do it...
Satish

Re: talk outline...

ad...@eecs.berkeley.edu (Aditi S. Muralidharan) — Tue, 30 Nov 2010 22:08:49 UT

Hi Satish,
We met for feedback last Friday (11/19) - I am presenting the paper
hierarchical graph partitioning. You said you wanted to hear more
detail on the optimality of spectral bisection and the runtime of the
algorithm, so I have prepared that. Could we meet this Friday for the
final presenation?

talk outline...

sati...@eecs.berkeley.edu (Satish Rao) — Mon, 29 Nov 2010 17:54:03 UT

The talk outline "accept until" has been moved to tomorrow.
I did notice that the outline was actually due November 12.
Somehow, I thought it was my fault that everything
is not front loaded. It seems that some students also
bear a significant amount of responsibility. Hmmm...
In any case, get scheduling! (If I did not respond

Re: concern about 8 assignments

sati...@eecs.berkeley.edu (Satish Rao) — Mon, 29 Nov 2010 17:35:43 UT

Just turn everything in soon.
Satish

Re: concern about 8 assignments

anuj.tewar...@gmail.com (anuj tewari) — Mon, 29 Nov 2010 06:17:08 UT

It seems that the assignment for lecture 15 and the summary for lecture on
Nov 23 are due before the assignment for lecture 14. Do the dates hold
value, or does it just mean we need to turn in everything soon?
-Anuj

concern about 8 assignments

sati...@eecs.berkeley.edu (Satish Rao) — Tue, 23 Nov 2010 18:30:58 UT

OK,
I did put up 8 assignments (or so). Here is
my explanation (lame or not) to try
to calm some concerns.
I apologize that the assignments are up late, though
the notes have been available for a while.
While the work is not quite as front
loaded as planned, I do expect that
the material throughout the semester

Re: Talk outline and schedule

sati...@eecs.berkeley.edu (Satish Rao) — Sat, 13 Nov 2010 16:34:35 UT

As I mentioned in class..
1) An outline of your talk.
Powerpoint would work.
2) After submitting we should meet
for a short meeting (say 15 minutes)
for you to get feedback.
3) Then schedule an hour(ish) time with
me to present the "talk."
Cheers,
Satish
----- Original Message -----
To: cs273 <cs273@googlegroups.com>

Talk outline and schedule

a...@berkeley.edu (aditi) — Sat, 13 Nov 2010 02:10:25 UT

What exactly are we supposed to submit? A description of our talk?
Powerpoint slides?. Also, are we supposed to pick a date, or date and
time.