Exams are coming!
Get ready with premium notes and study guides!

Textbook Notes for CS431 at University of Waterloo (UW)

  • 9 Result
  • About UW
UWCS431Adam RoegiestWinter

CS431 Chapter 7: Mutable Table

OC264717424 Page
0
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter 4: Analyzing Graphs

OC264717413 Page
0
Store both edges make sure your algorithm de-dups. Store one edge (x,y) such that x < y makes sure your algo handles asymmetry. Adjacency lists to edge
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter Notes - Chapter 1: Abstract Data Type, Deadlock, Mapreduce

OC264717429 Page
0
How do we know when a worker has finished? (or is simply waiting?) We don"t know the order in which workers run . We don"t know when workers interrupt
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter Notes - Chapter 3: Power Law, N-Gram, Mapreduce

OC264717419 Page
0
Basic idea: limit history to fixed number of (n 1) words (markov assumption) Need better estimators because mles give us a lot of zeros. Take from the
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter 10: Bonus Lecture

1 Page
0
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter 5: Analyzing Relational Database

OC26471746 Page
0
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter 9: Real Time Analysis

OC264717412 Page
0
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter Notes - Chapter 2: Mapreduce, Memory Management, Instruction Set

OC264717420 Page
0
Hadoop is still too low-level than we like. Example: find the top 10 most visited pages in each category. Pig is slower - higher level language built o
View Document
UWCS431Adam RoegiestWinter

CS431 Chapter Notes - Chapter 8: Graph Partition, Big Data, Mysql

OC264717413 Page
0
Schimmy: separate the two dataflows, shuffle only the messages. Basic idea: merge join between graph structure and messages. To coarsen the graph you n
View Document
Showing 1 — 9 of 9 result
View all professors (1+)

Textbook Notes (270,000)
CA (160,000)
UW (5,000)
CS (90)
CS431 (9)