CS 191 , Fall 2014 Lecture 3 : Writing in the Large ( Continued ) September 19 , 2014 Scribe :
نویسنده
چکیده
In the last lecture, we saw how we should write the title for a paper. We also critiqued some titles of published papers. In this lecture, we will continue the topic of writing in the large. We will discuss writing the date, the abstract, and the introduction. We will also critique an abstract of a paper written by Tom and his former student Geeta. Zobel, in [1], recommends a writer to ask himself/herself a list of questions before starting to write. These are a helpful set of questions that you might ask yourself in order to set the scope of your paper. We list a summary of the questions from his list. The interested reader is referred to the actual list of questions given on page 138 in [1].
منابع مشابه
CS 49 : Data Stream Algorithms Lecture Notes , Fall 2011 Amit
Acknowledgements These lecture notes began as rough scribe notes for a Fall 2009 offering of the course " Data Stream Algorithms " at Dartmouth College. The initial scribe notes were prepared mostly by students enrolled in the course in 2009. Subsequently, during a Fall 2011 offering of the course, I edited the notes heavily, bringing them into presentable form, with the aim being to create a r...
متن کاملCS 191 – Fall 2014 Lecture 10 : Generalized measurement , partial trace , and distance in state space
where the Pi are projectors (PiPj = Piδij) and the λi are unique, meaning that the Pi are not necessarily rank 1. If the Pi is not rank 1, then it can be expressed as a sum of rank 1 projectors: i.e., if the rank of Pi is k, Pi = ∣∣φi1〉 〈φi1∣∣+ ∣∣φi2〉 〈φi2∣∣ ...+ ∣∣φik〉 〈φik∣∣. Measuring an observable O on a state |ψ〉 yields a result that we label with the λi, and we think of the measurement as...
متن کاملCS 191 – Fall 2014 Lecture 18 : Fault - tolerance and the threshold theorem
Now that we have looked at a few error correction codes and their implementation, we are ready to examine the notion of fault tolerance. The basic idea of fault tolerance is that if we perform error correction “well”, then it is possible to execute an arbitrarily long quantum computation with “reasonable” resources. This may seem intuitive but it is a nontrivial statement because (i) we need to...
متن کاملCS 286 . 2 Lecture 1 : The PCP theorem , hardness of approximation , and multiplayer games Scribe :
Our first formulation gives the theorem its name (PCP = Probabilistically Checkable Proof). It states that, provided that one is willing to settle for a probabilistic decision process that errs with small probability, all languages in NP have proofs that can be verified very efficiently: only a constant number of symbols of the proof need to be evaluated! To state this formally we first need th...
متن کاملAlgorithmic Lower Bounds : Fun With Hardness Proofs Fall 2014 Lecture 3 Scribe Notes
Last time, we established the hardness of two fundamental problems, (2-)Partition and 3-Partition, and exhibited a bunch of reductions from those problems to other numerical and geometrical ones. Today, we continue with reductions from 3and 2-Partition to geometrical problems—we’ll also use the fact that the problem of packing n squares into a square without rotations is strongly NP-complete, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014