Projects funded by the NCN
Nearest neighbors problem without false negatives.
2018/29/N/ST6/00676
Keywords:
nearest neighbors locality sensitive hashing high-dimensional similarity search
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 15 - announced on 2018-03-15
Amount awarded: 90 100 PLN
Project start date (Y-m-d): 2019-01-24
Project end date (Y-m-d): 2021-01-23
Project duration:: 24 months (the same as in the proposal)
Project status: Project settled
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Equipment purchased [PL]
- Laptop (11 000 PLN)
Information in the final report
- Articles in post-conference publications (2)
- Improved Feature Importance Computations for Tree Models: Shapley vs. BanzhafAuthors:Anish Mukherjee Adam Karczmarz Piotr Sankowski Piotr WygockiConference:AAAI (rok: 2022, ), Wydawca: SpringerData:konferencja 2022-02-21-28Status:Submitted
- The PACE 2020 Parameterized Algorithms andComputational Experiments Challenge: TreedepthAuthors:Kowalik, Łukasz ; Mucha, Marcin ; Nadara, Wojciech ; Pilipczuk, Marcin ; Sorge, Manuel ; Wygocki, PiotrConference:15th International Symposium on Parameterized and Exact Computation (IPEC 2020) (rok: 2020, ), Wydawca: Schloss Dagstuhl--Leibniz-Zentrum f{"u}r InformatikData:konferencja 04.12.2020Status:Published