Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Dhruti Shah"'
Publikováno v:
ICASSP
In many applications, a dataset can be considered as a set of observed signals that live on an unknown underlying graph structure. Some of these signals may be seen as white noise that has been filtered on the graph topology by a graph filter. Hence,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::331500f0a27a6f73a2b590d581074a33
Publikováno v:
AAAI
We consider the problem of adaptively PAC-learning a probability distribution $\mathcal{P}$'s mode by querying an oracle for information about a sequence of i.i.d. samples $X_1, X_2, \ldots$ generated from $\mathcal{P}$. We consider two different que
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e600d9a02fa42137d0d43fddc9ea72cf
http://arxiv.org/abs/1911.08197
http://arxiv.org/abs/1911.08197
Publikováno v:
Journal of Complex Networks. 8
The Jordan centre of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detection problems. We study properties of the Jordan centre in the case of r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a558b8c384aea09cc105d49517b92a9
https://doi.org/10.1093/comnet/cnz035
https://doi.org/10.1093/comnet/cnz035
Publikováno v:
NCC
In this paper, we analyse the problem of top- $m$ clustering with access to a noisy oracle. We consider a model where there are $n$ nodes, belonging to $k$ clusters. We have access to an oracle which when queried with a pair of nodes, returns a binar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fbb7b614f0f858e0b995eeca89e088d
https://doi.org/10.1109/ncc.2019.8732224
https://doi.org/10.1109/ncc.2019.8732224
Autor:
Dhruti Shah
•WINNER• ‘SHORT BUSINESS BOOK OF THE YEAR'– THE BUSINESS BOOK AWARDS 2021 Unicorns, narwhals, yaks, cows and civets - what have all these creatures got to do with your hard-earned cash? Well, far more than you would think at first glance. T
Publikováno v:
ASONAM
The Jordan center of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detection problems. We study properties of the Jordan Center in the case of r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39b3cfd6e318b25de79a80e04e29fd3b