Graph Stream Algorithms: A Survey

http://people.cs.umass.edu/~mcgregor/papers/13-graphsurvey.pdf

Networks, Crowds, and Markets

http://www.cs.cornell.edu/home/kleinber/networks-book/

نظریه پردازش موازی

https://wiki.cites.illinois.edu/wiki/display/cs498tpc/Theory+of+Parallel+Computing

O با یک علامت ~

http://en.wikipedia.org/wiki/%C3%95#Mathematical_use

Geometric Optimization (Fall 2013)

مرجع: http://www.cs.tau.ac.il/~michas/optcourse.html

استاد: Sharir

The syllabus of the course 

===== 

The syllabus may not exactly coincide with the material that will be taught. It will be (slightly) updated during the semester 

===== 

(1) Parametric Searching:

The basic technique

Illustration: Slope selection

Issues in parallel computation

Cole's improvement

Alternatives: Probabilistic approach, Expanders, Monotone Matrix Searching, Chan's technique

===== 

(2) Linear Programming: Geometric Approach:

Review of Megiddo's algorithm and Seidel's randomized algorithm. Algorithms by Clarkson and by Matousek et al.

Abstract linear programming: Framework, geometric applications, variants

===== 

(3) Search in Monotone Matrices: 

===== 

(4) Facility Location:

The p-center probolem

Efficient algorithm for the 2-center problem

Exact and approximate algorithms for the general case

Clustering

The p-median problem and other variants

===== 

(5) Diameter in Three Dimensions:

A randomized algorithm

A deterministic algorithm

===== 

(6) Geometric Optimization and Arrangements:

Hausdorff distances

Width in three dimensions

Polygon placements; biggest stick in a polygon.

===== 

(7) Shortest Paths:

Shortest paths in the plane

Shortest paths on a convex polytope and in polyhedral 3-D regions

Approximate shortest paths

===== 

(8) Approximation Algorithms for Geometric Optimization:

Euclidean travelling salesperson

Approximating diameter, width, minimum-width annuli and cylinders

===== 

(9) Approximate Nearest Neighbor Search in Higher Dimensions:

Review of recent techniques

درس الگوریتم‌های رباتیک و برنامه‌ریزی حرکت

مرجع: http://www.cs.tau.ac.il/~danha/courses/robotics07.html

دریافت
حجم: 241 کیلوبایت

درس Motion Planning in Real and Virtual Worlds

سایت درس:

http://gamma.cs.unc.edu/courses/planning-f07/

مرجع درس: LaValle's Book on Planning Algorithms

دانلود کتاب درس و ...

http://planning.cs.uiuc.edu/

ارائه‌ی مورد علاقه‌ی من: Visibility based Motion Planning (Georgi Tsankov , October 10, 2007)

Coverage Planning (Jamie Snape, October 15, 2007)

sublinear algorithms mit

عمرمون بر فناست اگه اینها رو ندونیم! :)

http://stellar.mit.edu/S/course/6/fa07/6.895/courseMaterial/topics/topic1/lectureNotes/lec13/lec13.pdf

http://stellar.mit.edu/S/course/6/fa07/6.895/courseMaterial/topics/topic1/lectureNotes/lec16/lec16.pdf

http://stellar.mit.edu/S/course/6/fa07/6.895/courseMaterial/topics/topic1/lectureNotes/lec18/lec18.pdf

http://stellar.mit.edu/S/course/6/fa07/6.895/courseMaterial/topics/topic1/lectureNotes/lec15/lec15.pdf

مرجع:

http://stellar.mit.edu/S/course/6/fa07/6.895/materials.html

دلیل اینکه در هندسه محاسباتی پیشرفته است روش‌های merge and reduce و مثل آن است که در این درس آمده است.

Social and Information Network Analysis

http://www.stanford.edu/class/cs224w/index.html

تعدادی از درس‌های الگوریتمی

الگوریتم تقریبی پیشرفته

http://www.cs.cmu.edu/~anupamg/adv-approx/

الگوریتم‌های دنیای واقعی (شامل LSH و چند تا از مدل‌های جویبار داده و الگوریتم موازی و ...)

http://www.cs.cmu.edu/afs/cs/project/pscico-guyb/realworld/www/slidesS14.html

کاربرد متریک در مسائل الگوریتمی

http://www.cs.cmu.edu/~anupamg/metrics/index.html

همه‌ی این درس‌ها را یک نفر ارائه می‌دهد:

http://www.cs.cmu.edu/~anupamg/