Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
education [2017/12/14 14:54] damaskin |
education [2018/09/02 13:55] rouault Updated link ca_2017 -> ca_2018 |
||
|---|---|---|---|
| Line 8: | Line 8: | ||
| \\ | \\ | ||
| \\ | \\ | ||
| - | * [[education/ca_2017|Concurrent Algorithms]] | + | * [[education/ca_2018|Concurrent Algorithms]] |
| * [[education/da|Distributed Algorithms]] | * [[education/da|Distributed Algorithms]] | ||
| * <html><a href="http://moodle.epfl.ch/course/view.php?id=14044">Information, Calcul et Communication</a></html> | * <html><a href="http://moodle.epfl.ch/course/view.php?id=14044">Information, Calcul et Communication</a></html> | ||
| Line 21: | Line 21: | ||
| ===== Master Projects ===== | ===== Master Projects ===== | ||
| - | LPD offers master projects in the following areas: | + | DCL offers master projects in the following areas: |
| * **Dynamically Distributed Spatial Indexing**: a project here would consist in studying existing spatial index data structures and algorithms, e.g., simple grids, Quadtrees, R-Trees etc., and how they may be dynamically distributed for indexing a large number of moving objects; please contact [[mailto:benoit.garbinato@unil.ch|Benoit Garbinato]] to get more information. | * **Dynamically Distributed Spatial Indexing**: a project here would consist in studying existing spatial index data structures and algorithms, e.g., simple grids, Quadtrees, R-Trees etc., and how they may be dynamically distributed for indexing a large number of moving objects; please contact [[mailto:benoit.garbinato@unil.ch|Benoit Garbinato]] to get more information. | ||
| Line 29: | Line 29: | ||
| * **Dynamic distributed computing**: a project here would consist for instance in designing and implementing applications that would run in a simulation of a cloud with high churn, but possibly robust to arbitrary behavior of some of its components; please contact [[http://people.epfl.ch/matej.pavlovic|Matej Pavlovic]] to get more information. | * **Dynamic distributed computing**: a project here would consist for instance in designing and implementing applications that would run in a simulation of a cloud with high churn, but possibly robust to arbitrary behavior of some of its components; please contact [[http://people.epfl.ch/matej.pavlovic|Matej Pavlovic]] to get more information. | ||
| - | |||
| - | * **[[List of Projects|Recommender systems]]** | ||
| * **[[Distributed ML|Distributed Machine Learning]]** | * **[[Distributed ML|Distributed Machine Learning]]** | ||
| Line 40: | Line 38: | ||
| * **Distributed database algorithms**: a project here would consist in implementing and evaluating protocols that are running in today's database systems, e.g., [[https://en.wikipedia.org/wiki/Two-phase_commit_protocol|2PC]], and comparing them with those protocols that can potentially be used in future database systems; please contact [[http://people.epfl.ch/jingjing.wang|Jingjing Wang]] to get more information. | * **Distributed database algorithms**: a project here would consist in implementing and evaluating protocols that are running in today's database systems, e.g., [[https://en.wikipedia.org/wiki/Two-phase_commit_protocol|2PC]], and comparing them with those protocols that can potentially be used in future database systems; please contact [[http://people.epfl.ch/jingjing.wang|Jingjing Wang]] to get more information. | ||
| - | * **Machine learning attacks privacy**: a project here would consist in implementing attacks to privacy-preserving platforms using machine learning (e.g., a neural network); please contact [[http://people.epfl.ch/mahsa.taziki|Mahsa Taziki]] to get more information. | ||