Zobrazeno 1 - 10
of 124
pro vyhledávání: '"T-H. Hubert Chan"'
Autor:
Pui-Wai Ma, T.-H. Hubert Chan
Publikováno v:
Neural Networks. 161:154-164
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5a5ffb16a2314b438a397a2e9da79de
https://doi.org/10.1016/j.neunet.2023.01.042
https://doi.org/10.1016/j.neunet.2023.01.042
Publikováno v:
Journal of the ACM. 69:1-49
It is well-known that a program’s memory access pattern can leak information about its input. To thwart such leakage, most existing works adopt the technique of oblivious RAM (ORAM) simulation. Such an obliviousness notion has stimulated much debat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f39f6089f450064d26dc1a36b333ac2
https://doi.org/10.1145/3555984
https://doi.org/10.1145/3555984
Publikováno v:
Advances in Cryptology – EUROCRYPT 2023 ISBN: 9783031306198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8f03c6f90b8b1f50a3e2a92dbfda65b
https://doi.org/10.1007/978-3-031-30620-4_1
https://doi.org/10.1007/978-3-031-30620-4_1
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783031334900
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef88eafa30e31173af7c78f2b41f35d3
https://doi.org/10.1007/978-3-031-33491-7_22
https://doi.org/10.1007/978-3-031-33491-7_22
Autor:
Rediet Abebe, Jon Kleinberg, Zhibin Liang, T.-H. Hubert Chan, Charalampos E. Tsourakakis, David C. Parkes, Mauro Sozio
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 16:1-34
A long line of work in social psychology has studied variations in people’s susceptibility to persuasion—the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an interesting perspective on theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f16a60029617cd3c024825ac0ecf6c2c
https://doi.org/10.1145/3466617
https://doi.org/10.1145/3466617
Publikováno v:
Journal of Parallel and Distributed Computing. 147:87-99
We design distributed algorithms to compute approximate solutions for several related graph optimization problems. All our algorithms have round complexity being logarithmic in the number of nodes of the underlying graph and in particular independent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eee64bfcf6901d2dc8d81e54f195c55b
https://doi.org/10.1016/j.jpdc.2020.08.010
https://doi.org/10.1016/j.jpdc.2020.08.010
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 14:1-21
In this article, we design algorithms to maintain approximate core values in dynamic hypergraphs. This notion has been well studied for normal graphs in both static and dynamic setting. We generalize the problem to hypergraphs when edges can be inser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c7f63928260846459046291abf15b49
https://doi.org/10.1145/3385416
https://doi.org/10.1145/3385416
Publikováno v:
ACM Transactions on Algorithms. 16:1-23
We present a unified polynomial-time approximation scheme (PTAS) for the prize collecting traveling salesman problem (PCTSP) and the prize collecting Steiner tree problem (PCSTP) in doubling metrics. Given a metric space and a penalty function on a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33187196e6f967a0c80b7d27005056a8
https://doi.org/10.1145/3378571
https://doi.org/10.1145/3378571
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 32:506-518
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our method uses a convex program whose objective function is not everywhere differentiable. We exploit the non-uniqueness of the optimal solutions, and consider confiden
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::644d463b9032252df0d6df73d07526cc
https://doi.org/10.1109/tkde.2018.2880448
https://doi.org/10.1109/tkde.2018.2880448
Autor:
Zhibin Liang, T.-H. Hubert Chan
Publikováno v:
Theoretical Computer Science. 806:416-428
In a recent breakthrough STOC 2015 paper, a continuous diffusion process was considered on hypergraphs (which has been refined in a recent JACM 2018 paper) to define a Laplacian operator, whose spectral properties satisfy the celebrated Cheeger’s i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2aef9de60fe87804cb1ce63df253bce1
https://doi.org/10.1016/j.tcs.2019.07.024
https://doi.org/10.1016/j.tcs.2019.07.024