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 [2018/03/27 13:19] taziki |
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. | ||