Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Hakan Ferhatosmanoglu"'
Autor:
Chris Conlan, Teddy Cunningham, Sam Watson, Jason Madan, Alexandros Sfyridis, Jo Sartori, Hakan Ferhatosmanoglu, Richard Lilford
Publikováno v:
PLOS Global Public Health, Vol 3, Iss 2, p e0001281 (2023)
When a person chooses a healthcare provider, they are trading off cost, convenience, and a latent third factor: "perceived quality". In urban areas of lower- and middle-income countries (LMICs), including slums, individuals have a wide range of choic
Externí odkaz:
https://doaj.org/article/224ecc604bfb4e80a65f2b8689389903
Publikováno v:
ACM Transactions on Spatial Algorithms and Systems. 9:1-30
Current approaches for modeling propagation in networks (e.g., of diseases, computer viruses, rumors) cannot adequately capture temporal properties such as order/duration of evolving connections or dynamic likelihoods of propagation along connections
Publikováno v:
Yu, W, Iranmanesh, S, Haldar, A, Zhang, M & Ferhatosmanoglu, H 2022, ' RoleSim* : Scaling axiomatic role-based similarity ranking on large graphs ', World Wide Web, vol. 25, no. 2, pp. 785-829 . https://doi.org/10.1007/s11280-021-00925-z
RoleSim and SimRank are among the popular graph-theoretic similarity measures with many applications in, e.g., web search, collaborative filtering, and sociometry. While RoleSim addresses the automorphic (role) equivalence of pairwise similarity whic
Publikováno v:
Proceedings of the VLDB Endowment. 14:2283-2295
Sharing trajectories is beneficial for many real-world applications, such as managing disease spread through contact tracing and tailoring public services to a population's travel patterns. However, public concern over privacy and data protection has
SimRank is an attractive link-based similarity measure used in fertile fields of Web search and sociometry. However, the existing deterministic method by Kusumoto et al. [ 24 ] for retrieving SimRank does not always produce high-quality similarity re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5099ea242a85f5a743a11b23d41bc73
http://hdl.handle.net/10044/1/94629
http://hdl.handle.net/10044/1/94629
Publikováno v:
IWCTS@SIGSPATIAL
Shortest path queries over graphs are usually considered as isolated tasks, where the goal is to return the shortest path for each individual query. In practice, however, such queries are typically part of a system (e.g., a road network) and their ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dcfd1a209e981501f19a8b359f3c42b
http://arxiv.org/abs/2110.09937
http://arxiv.org/abs/2110.09937
Publikováno v:
SSTD
Sharing sensitive data is vital in enabling many modern data analysis and machine learning tasks. However, current methods for data release are insufficiently accurate or granular to provide meaningful utility, and they carry a high risk of deanonymi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2004e1144d1bd3dde2ec2900b12b9d8a
http://arxiv.org/abs/2108.02089
http://arxiv.org/abs/2108.02089
Publikováno v:
ICS '21: Proceedings of the ACM International Conference on Supercomputing
The state-of-the-art deep neural networks (DNNs) have significant computational and data management requirements. The size of both training data and models continue to increase. Sparsification and pruning methods are shown to be effective in removing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13121008444bf7b8ed2373693e2497ee
http://arxiv.org/abs/2104.11805
http://arxiv.org/abs/2104.11805
Autor:
Shuang Wang, Hakan Ferhatosmanoglu
We present PPQ-trajectory, a spatio-temporal quantization based solution for querying large dynamic trajectory data. PPQ-trajectory includes a partition-wise predictive quantizer (PPQ) that generates an error-bounded codebook with autocorrelation and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c97a6a66476d031589745dfc2f0c36d
http://arxiv.org/abs/2010.13721
http://arxiv.org/abs/2010.13721
Autor:
Aparajita Haldar, Tanaya Guha, Yulan He, George Vogiatzis, Vishwash Batra, Hakan Ferhatosmanoglu
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030454388
ECIR (1)
ECIR (1)
We address and formalise the task of sequence-to-sequence (seq2seq) cross-modal retrieval. Given a sequence of text passages as query, the goal is to retrieve a sequence of images that best describes and aligns with the query. This new task extends t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89cda1545b8cf55017529ac676908b6d
http://wrap.warwick.ac.uk/136120/1/WRAP-variational-recurrent-sequence-to-sequence-retrieval-stepwise-illustration-Batra-2020.pdf
http://wrap.warwick.ac.uk/136120/1/WRAP-variational-recurrent-sequence-to-sequence-retrieval-stepwise-illustration-Batra-2020.pdf