We are looking for excellent candidates with a strong background in the design, analysis, and implementation of algorithms. The project is entitled "Benefit and Bias of Approximate Nearest Neighbor Search for Machine Learning and Data Mining". The goal is to design, implement, and evaluate nearest neighbor search techniques to speed-up key components for data mining and machine learning applications such as clustering and outlier detection.
The algorithms group at ITU carries out research in theoretical computer science and algorithm engineering. We strive for academic excellence and collegial respect. ITU co-hosts Basic Algorithms Research Copenhagen (BARC) jointly with the University of Copenhagen. Located in one of the most-livable cities in the world, we provide excellent salary, working conditions, and a down-to-earth research environment. Copenhagen has a strong educational system, a rich cultural life, universal healthcare, good childcare, and well-functioning infrastructure. Copenhagen is among the world's most livable cities according to the Economist Global Liveability Index.
The application deadline is August 15, 2022. Please see https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=181463&DepartmentId=3439&MediaId=5 for the full announcement with more information and instructions on how to apply. Informal enquiries are encouraged and may be sent to maau@itu.dk (Martin Aumüller) and zimek@imada.sdu.dk (Arthur Zimek).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
