Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
start [2018/02/02 13:42] – [Short summary] chafik | start [2018/06/20 08:57] (current) – guilherme | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Geometry, imaGes, learninG and alGorithms ====== | + | ====== Geometry, imaGes, learninG, and alGorithms ====== |
The research group **Geometry, imaGes, learninG and alGorithms** (G4) is a member of the [[http:// | The research group **Geometry, imaGes, learninG and alGorithms** (G4) is a member of the [[http:// | ||
Line 14: | Line 14: | ||
The research topics of this group are centered on n-dimensional data modeling and analysis, from both methodology and application points of view. The team's interdisciplinary skills result in projects that cover a wide range of scientific topics including Geometry, Data Mining, Machine Learning, Data Structures, and their interactions for several fields of application. | The research topics of this group are centered on n-dimensional data modeling and analysis, from both methodology and application points of view. The team's interdisciplinary skills result in projects that cover a wide range of scientific topics including Geometry, Data Mining, Machine Learning, Data Structures, and their interactions for several fields of application. | ||
- | For a brief description of our main research areas, we cite: | + | For a brief description of our main research areas, we mention: |
* **Machine learning**: We address several | * **Machine learning**: We address several | ||
Line 26: | Line 26: | ||
* **Computational geometry**: We design algorithms and data structures for numerous geometric problems related to range searching, geometric graphs, and several other topics. We analyze that asymptotic complexity of these algorithms and also prove lower bounds for the complexity of the problems. | * **Computational geometry**: We design algorithms and data structures for numerous geometric problems related to range searching, geometric graphs, and several other topics. We analyze that asymptotic complexity of these algorithms and also prove lower bounds for the complexity of the problems. | ||
- | * **Image and video processing**: | + | * **Image and video processing**: |
- | National collaborations include: | + | National collaborations include: LITIS (Rouen), LMV (Clermont-Ferrand), |
- | + | ||
- | LITIS (Rouen), LMV (Clermont-Ferrand), | + | |
International collaborations include: | International collaborations include: | ||
Line 40: | Line 38: | ||
* Norway: University of Bergen | * Norway: University of Bergen | ||
* USA: University of California Los Angeles, Florida State University, Ohio State University, Rice University, and University of Maryland | * USA: University of California Los Angeles, Florida State University, Ohio State University, Rice University, and University of Maryland | ||
+ | |||
===== News ===== | ===== News ===== | ||
* **January 2018:** first public version of [[http:// | * **January 2018:** first public version of [[http:// |