My Profile
My Papers
My Contacts
My Courses
My Favorites
My Inbox
Invite Friends
sign up
Login
Paper Key
Courses
Members
Papers
Join Course
Invite Members
Behavior of Algorithms, Spring 2002, MIT
17 Papers
|
1 Member
| Created by
Bar tender
on
8/20/2008
| Category: Algorithms
Description: This course is a study of Behavior of Algorithms and covers an area of current interest in theoretical computer science. The topics vary from term to term. During this term, we discuss rigorous approaches to explaining the typical performance of algorithms with a focus on the following approaches: smoothed analysis, condition numbers/parametric analysis, and subclassing inputs.
Papers
Discussion
Members
Sort By:
Latest
Most Viewed
Most Commented
9 - Smoothed Analysis and Monotone Adversaries for Bandwidth and Graph Bisection
9 - Smoothed Analysis and Monotone Adversaries for Bandwidth and Graph Bisection
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 234
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Adversaries
Bandwidth
Bisection
graph
Monotone
Smoothed
1 - The Condition Number
1 - The Condition Number
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 214
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Condition
Number
10 - von Neumann's Algorithm, Primal and Dual Simplex Methods
10 - von Neumann's Algorithm, Primal and Dual Simplex Methods
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 416
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Algorithm
Dual
Neumann
Primal
Simplex
von
11 - Strong Duality Theorem of Linear Programming
11 - Strong Duality Theorem of Linear Programming
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 1105
Rating: 0
0 Comments
Category:
Algorithms
Tags:
DUALITY
linear
programming
Strong
12 - Analysis of von Neumann's Algorithm
12 - Analysis of von Neumann's Algorithm
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 433
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Algorithm
Analysis
Neumann
von
13 - Worst-Case Complexity of the Simplex Method
13 - Worst-Case Complexity of the Simplex Method
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 1020
Rating: 0
0 Comments
Category:
Algorithms
Tags:
complexity
Method
Simplex
Worst-Case
14 - The Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
14 - The Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 226
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Convex
Gaussian
Hull
Plane
Points
random
15 - The Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
15 - The Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 234
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Convex
Expected
Facets
Gaussian
Hull
Number
of
Plane
Points
random
the
16 - The Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
16 - The Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 228
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Convex
Expected
Facets
Gaussian
Hull
Number
of
Plane
Points
random
the
17 - Polytope Given by Gaussian Random Constraints- Angle Bound and Overview of Phase 1
17 - Polytope Given by Gaussian Random Constraints- Angle Bound and Overview of Phase 1
[
Remove from course
]
By
Bar tender
August 20, 2008
Views: 206
Rating: 0
0 Comments
Category:
Algorithms
Tags:
Angle
Bound
constraints
Gaussian
Polytope
random
1
2
Course Members
Bar tender
New York USA
Massachusetts Institute of Technology, Massachusetts
Papers(7442)
Send Message
