Zobrazeno 1 - 10
of 184
pro vyhledávání: '"Piotr Indyk"'
Advances in computational geometry and machine learning that offer new methods for search, regression, and classification with large amounts of high-dimensional data. Regression and classification methods based on similarity of the input to stored ex
Publikováno v:
SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23) ISBN: 9781611977714
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f8cb712c669c087c4f681f5ba21e6f0
https://doi.org/10.1137/1.9781611977714.8
https://doi.org/10.1137/1.9781611977714.8
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-9 (2024)
Abstract Among parasites of the digestive tract of the black-headed gull (Chroicocephalus ridibundus) in Poland, the best known are species of digenetic trematodes and cestodes. Nematodes of this bird species are not well known. Black-headed gulls, d
Externí odkaz:
https://doaj.org/article/b60b33d3bcec4f0d9f1e66a748006bd0
Autor:
Dawid Moroń, Michał Beim, Agnieszka Gudowska, Fabio Angeoletto, Waldemar Celary, Aleksandra Cwajna, Piotr Indykiewicz, Magdalena Lenda, Emilia Marjańska, Annette Menzel, Piotr Skórka, Piotr Tryjanowski
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-10 (2024)
Abstract Tramways in urban areas for mass transit has been suggested to have a lower environmental footprint than roads. However, studies on the impact of tramways and the surrounding infrastructure on biodiversity is extremely rare despite the poten
Externí odkaz:
https://doaj.org/article/63e535d4dec94acc8be4879d9c51cc3d
Autor:
Harald Räcke, Anupam Gupta, Kedar Dhamdhere, Anastasios Sidiropoulos, Mihai Badoiu, Yuri Rabinovich, Piotr Indyk, R. Ravi
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:454-473
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the 2-dimensional plane. Among other results, we give an $O(\sqrt{n})$-approximation alg...
Autor:
Piotr Indyk, Tal Wagner
We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for $\ell_1$ (a.k.a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ed622c6ebd281490c152624cffdd074
Autor:
Tianhong Li, Lijie Fan, Yuan Yuan, Hao He, Yonglong Tian, Rogerio Feris, Piotr Indyk, Dina Katabi
Contrastive learning is one of the fastest growing research areas in machine learning due to its ability to learn useful representations without labeled data. However, contrastive learning is susceptible to feature suppression, i.e., it may discard i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f00df4da3401dde6416fe501854f79e6
Autor:
Piotr Indyk, Ali Vakilian
Publikováno v:
PODS
We study the maximum k-coverage problem in the general edge-arrival streaming model: given a collection of m sets F, each subset of a ground set of elements U of size n, the task is to find k sets whose coverage is maximized. The sets are specified a
Publikováno v:
FOCS
Given a kernel function k(.,.) and a dataset P⊂ R^d, the kernel density function of P at a point xe R^d is equal to KDF_P(x):= 1/|P| Σ_yeP k(x, y). Kernel density evaluation has numerous applications, in scientific computing, statistics, computer