Home > Search Results

codes on graphs


  • 36 results
  • <
  • 1
  • 2
  • 3
  • >

sort by: Relevancy | Title try advanced search for more options

  1. Note: This course is being offered by Stanford this summer as an online course for credit. It can be taken individually, or as part of a master’s degree or graduate certificate earned online through the Stanford Center for Professional Development. This course is the natural successor to Programming Methodology and covers such advanced programming topics as recursion, algorithmic analysis, and data abstraction using the C++ programming...more

  2. This course is the second of a two-term sequence. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of Principles of Digital Communication I and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-d...more

  3. Environmental Politics and Law (EVST 255) The lecture critiques the U.S. Green Building Council's (USGBC) certification system, LEED (Leadership in Energy and Environmental Design). The criteria for being highly rated under LEED emphasize energy efficiency and minimizing waste, but do not prioritize environmental health and limiting use of dangerous plastics and chemicals. USGBC is a non-profit organization, not a government agency, and...more

  4. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  5. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  6. Algorithm Analysis, Evaluating the Performance, Analysis of Codes: Statement Counts, Another Example (Statement Count Contd.), Comparing Algorithm, Big-O Notation, Big-O to Predict the Time of Execution, Best/Worst/Average Case, Analysis of Recursive Algorithms, Another Example : Towers of Hanoi, A Tabulation for Different Algorithms, Growth Patterns, Application of Algorithm Analysis to Sorting, Selection Sort, Selection Sort Code

  7. Despite cautions from their conservative elders, young chemists like Paternó and van't Hoff began interpreting molecular graphs in terms of the arrangement of a molecule's atoms in 3-dimensional space. Benzene was one such case, but still more significant was the prediction, based on puzzling isomerism involving "optical activity," that molecules could be "chiral," that is, right- or left-handed. Louis Pasteur effected the first artificial...more

  8. The discussion of suicide continues. A few more cases are introduced to consider circumstances under which it might be rational to end one's life, and more graphs are drawn that show relevant variations in the quality of one's life. A question is then posed about how one should make a decision about continuing or ending life, given that one cannot know the future with certainty. Finally, two quick moral arguments concerning suicide which r...more

  9. How pictures have been used in mathematics.  The use of illustrations in ancient mathematics books, the invention of the first graphs and the representation of probabilities, sets and formulae by pictures.  We look at the role played by computers in exploring and displaying the behaviour of extremely large and complicated problems. This has changed the culture of applied mathematics and science and influences the way research is done and t...more

  10. Understanding concave upwards and downwards portions of graphs and the relation to the derivative. Inflection point intuition.

  11. Memory-less sources, prefix free codes, and entropy