SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Sublinear Algorihms for Big Data

delling-ull avatar
delling-ull
8 diapositives · 194 Views · Nov 12, 2014

Solve sublinear algorithms for big data exam problems including Chernoff Bound, Chebyshev Inequality, Sparse Recovery Error, Median Value, Lower Bound, and MST Weight. Provide detailed explanations and formal answers. Submit by September 1st, 2014.

#sublinear algorihms for big data #sublinear algorihms for big data ppt #powerpoint #presentation
Sublinear Algorihms for Big Data - slide 1
01 / 8Sublinear Algorihms for Big Data
1 / 17

Télécharger la présentation

Sublinear Algorihms for Big Data
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. SublinearAlgorihms for Big Data Exam Problems GrigoryYaroslavtsev http://grigory.us

  2. Problem 1: Modified Chernoff Bound • Problem: Derive Chernoff Bound #2 from Chernoff Bound #1. Explain your answer in detail. • (Chernoff Bound #1) Let be independent and identically distributedr.vs with range [0, 1] and expectation . Then if and • (Chernoff Bound #2) Let be independent and identically distributedr.vs with range and expectation . Then if and

  3. Problem 2: Modified Chebyshev • Problem: Derive Chebyshev Inequality #2 from Chebyshev Inequality #1. Explain your answer in detail. • (Chebyshev Inequality #1) For every : • (Chebyshev Inequality #2) For every

  4. Problem 3: Sparse Recovery Error • Definition (frequency vector): = frequency of in the stream = # of occurrences of value • Sparse Recovery: Find such that is minimized among s with at most non-zero entries. • Definition: • Problem: Show that where are indices of largest . Explain your answer formally and in detail.

  5. Problem 4: Approximate Median Value • Stream: elements from universe • (all distinct) and let • Median , where + 1 ( odd). • Algorithm: Return the median of a sample of size taken from (with replacement). • Problem: Does this algorithm give a approximate value of the median with probability , i.e. such that if ? Explain your answer.

  6. Problem 5: Lower bound on • Definition (frequency vector): = frequency of in the stream = # of occurrences of value • Define (frequency moment): • Problem: Show that for all integer it holds that: • Hint: worst-case when . Use convexity of

  7. Problem 6: Approximate MST Weight • Let be a weighted graph with weights of all edges being integers between 1 and W. • Definition: Let be the # of connected components if we remove all edges with weight . • Problem: For some constant show the following bounds on the weight of the minimum spanning tree

  8. Evaluation • Deadline: September 1st , 2014, 23:59 GMT • Submissions in English: grigory@grigory.us • Submission Title (once): Exam + Space + “Your Name” • Question Title: Question + Space + “Your Name” • Submission format • PDF from LaTeX (best) • PDF • You can work in groups (up to 3 people) • Each group member lists all others on the submission • Point system • Course Credit = 2 points • Problems 1-3 = 0.5 point each • Problem 4 = 1 point • Problems 5-6 = 2 point each