Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
5Activity

Table Of Contents

1.2.2 Minimum Spanning Tree
1.2.3 Set Cover
2.1.1 Set Cover Problem
2.1.2 Upper bound on Greedy Set Cover Problem
2.2.1 Mergesort
2.2.2 Lower Bound on the Complexity of Sorting
2.2.3 Finding the k-th Largest Element
2.3 Dynamic Programming
3.1 Sequence Alignment
3.2 Shortest Path and the Bellman-Ford Algorithm
3.3 All Pairs Shortest Path
3.4 Time Bound Improvement
3.5 Negative Cycles
3.6 Floyd-Warshall
4.1 Problem Definition
4.2 Ford-Fulkerson Algorithm
5.1 Introduction and Recap
5.2 Bipartite Matching
5.3 Scheduling Problems
5.4.1 Image Segmentation
5.4.2 Image Segmentation cont
5.5 Max-Flow with Costs
6.1 Introduction
6.2 Motivation
6.4.3 Karger’s algorithm: a randomized method
7.1.1 Balls and Bins
7.1.2 Randomized Load Balancing
7.2.1 Ideal Situation - Truly Random
7.2.2 2-Universal Family of Hash Functions
7.2.3 An Example of 2-Universal Hash Functions
8.1.1 Perfect hashing – reducing worst case loopkup time
8.1.2 Perfect hashing with linear space
8.2 Bloom Filters
8.3.1 P and NP
8.3.2 P-time reducibility
8.3.3 NP-Completeness
9.1 Cook-Levin Theorem
9.2 Vertex Cover
9.3 Approximation Algorithms
10.1 Fundamentals of Local Search
10.2 Max-Cut Problem
10.3.1 Problem Definition
10.3.2 A local search algorithm
10.3.3 Analysis
11.1.1 Review
11.1.2 Notation
11.1.3 Completion of Facility Location
11.1.4 Wrap-up
11.2.1 Introduction
11.2.2 Solving a Linear Program
11.2.3 Integer Programming
11.2.5 Vertex Cover Revisited
11.3 Next Time
12.1.1 ILP formulation of set cover
12.1.2 Relaxing to an LP problem
12.1.3 Deterministic rounding
12.1.4 Randomized rounding
12.2.1 Markov’s Inequality
12.2.2 Chebyshev’s Inequality
12.2.3 Chernoff’s bound
13.1.1 ILP formulation with exponential number of variables and constraints
13.1.2 ILP formulation with polynomial number of variables and constraints
13.1.3 Deterministic rounding
13.1.4 Randomized rounding
13.2 LP Duality
14.1 Last Time
14.2 Constructing a Dual
14.3 LP Duality Theorems
14.4 Simple Example
14.5 The Power of LP-Duality
14.6.1 Max-flow LP
14.6.2 Alternate Max-flow LP
14.6.3 The Dual to the Max-flow LP
14.7 Next Time
15.1 Introduction
15.2 Vertex Cover
15.3 Basic Primal-Dual Algorithm
15.4 Minimax principle
16.1 L.P. Duality Applied to the Minimax Theorem
16.2 Max-Cut Problem
16.3 Vector Programs
16.4.1 Definitions
16.4.2 A Different View of Semi-Definite Programming
16.4.3 Feasible Region of an SDP
17.1 Last Time
17.2.1.1 Quadratic Programs
17.2.1.2 Vector Program
17.2.1.3 Semi-Definite Program
17.2.2 Solving Vector Programs
17.2.3 Algorithm
17.2.4 Wrap-up
17.3.1 Examples
17.3.2 Number of Distinct Elements
17.4 Next Time
18.1 Introduction and Recap
18.2 Number of Distinct Elements
18.3.1 Space requirements
18.3.2 Improving the accuracy: Median of means method
19.1 Introduction
19.2 More on sampling
19.3.1 Rent or Buy (Ski rental)
19.3.2 List Update
20.1 Caching
20.2 Optimal Caching Algorithm
20.3 Deterministic Caching
20.4 Randomized 1-Bit LRU
21.1 K Server Problems
22.1 Introduction and Recap
22.2 Work Function Algorithm
22.3 Metric Task System Problem
22.4 Online Learning
23.1 Prediction Problem
23.2 Mistake Bound Model for Learning
23.3.1 Concept class of OR functions
23.3.2 Concept class of OR functions of maximum size k
23.4 r out of k Concept Class
24.1 Introduction
24.2 Winnow Algorithm
24.3 Linear Threshold Functions
24.4 Perceptron Algorithm
24.5 Extensions to the prediction problem
24.6 Introduction to PAC Model
25.1.1.1 A PAC-learning algorithm for DLs
25.1.2.1 Decision Trees
25.1.2.2 AND-formulas
25.1.2.3 OR-formulas
25.1.2.4 3-CNF formulas
25.1.2.5 3-DNF formulas
25.1.2.6 3-term DNF formulas
25.2 PAC-Learning—a revised definition
25.3 Occam’s Razor
26.1.1 PAC-learnability and consistency
26.1.2 Noisy Data
26.2.1.1 Choosing k
26.2.1.2 Choosing |Sk+1|
26.2.1.3 Final confidence boosting algorithm
26.3 Error Reduction
26.4 Closing Remarks
26.5 Next Time
27.1 Introduction
27.2 Properties of random walks
27.3 Transition matrix
27.4 Stationary distributions
27.5 Random walks on edges
27.6 Cover time
27.7 Testing s-t connectivity
28.1 Introduction
28.2 Resistive Networks
28.3 Analysis of Random Walks with Resistive Networks
28.4 Application of the resistance method
28.5.1 Line graphs
28.5.2 Lollipop graphs
28.6 Application of Random Walks
28.7 Next time
0 of .
Results for:
No results containing your search query
P. 1
All in One Algorithms

All in One Algorithms

Ratings: (0)|Views: 478 |Likes:
Published by cecile_gozalo

More info:

Published by: cecile_gozalo on Jun 11, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

12/14/2012

pdf

text

original

You're Reading a Free Preview
Pages 4 to 38 are not shown in this preview.
You're Reading a Free Preview
Pages 42 to 78 are not shown in this preview.
You're Reading a Free Preview
Pages 82 to 152 are not shown in this preview.
You're Reading a Free Preview
Page 156 is not shown in this preview.
You're Reading a Free Preview
Pages 160 to 195 are not shown in this preview.

Activity (5)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Anita Ray liked this
Anita Ray liked this
Toktam Tagahvi liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->