Zobrazeno 1 - 10
of 48
pro vyhledávání: '"George H. L. Fletcher"'
Publikováno v:
Journal of Combinatorial Optimization, 44(4), 2853-2870. Springer
The evolution of online social networks is highly dependent on the recommended links. Most of the existing works focus on predicting intra-community links efficiently. However, it is equally important to predict inter-community links with high accura
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22db71074f1de231480f2d3baf04116e
http://www.scopus.com/inward/record.url?scp=85113662593&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85113662593&partnerID=8YFLogxK
Publikováno v:
EPJ Data Science, Vol 10, Iss 1, Pp 1-24 (2021)
We study the problem of modeling temporal networks constrained by the size of a concurrent set, a characteristic of temporal networks shown to be important in many application areas, e.g., in transportation, social, process, and other networks. We pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d38a06fcfa2cab7b728d1c3242d3d55
https://doaj.org/article/ed4279c0f3ba4e939575016a9d809548
https://doaj.org/article/ed4279c0f3ba4e939575016a9d809548
Publikováno v:
Proceedings of the 27th ACM on Symposium on Access Control Models and Technologies.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15f7862adfb1a1463669cdc799e90484
https://doi.org/10.1145/3532105.3535032
https://doi.org/10.1145/3532105.3535032
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering, 32(7):8666073, 1333-1347. IEEE Computer Society
An increasing number of networks are becoming large-scale and continuously growing in nature, such that clustering on them in their entirety could be intractable. A feasible way to overcome this problem is to sample a representative subgraph and expl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c3b25a3c1bc78c162f4b681a425b876
https://doi.org/10.1109/tkde.2019.2904682
https://doi.org/10.1109/tkde.2019.2904682
Autor:
Daphne Miedema, George H. L. Fletcher
Publikováno v:
VL/HCC
SQL is a typical query language for performing data analytics. Although its usage is ubiquitous, learners experience that query formulation in SQL is error-prone and time-consuming. Prior research has shown that this is due to low expressive ease, ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::478301ae9d8a0814e669b3f180270ab3
https://doi.org/10.1109/vl/hcc51201.2021.9576431
https://doi.org/10.1109/vl/hcc51201.2021.9576431
Publikováno v:
SIGMOD Conference
Graph pattern cardinality estimation is the problem of estimating the number of embeddings of a query graph in a data graph. This fundamental problem arises, for example, during query planning in subgraph matching algorithms. There are two major appr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::def609cca756f3ffc9b8884221dc8c8e
https://doi.org/10.1145/3448016.3457246
https://doi.org/10.1145/3448016.3457246
Autor:
Keith W. Hare, George H. L. Fletcher, Sławek Staworko, Michael Schmidt, Leonid Libkin, Jan Hidders, Stefania Dumbrava, Angela Bonifati, Victor E. Lee, Bei Li, Filip Murlak, Juan F. Sequeda, Wim Martens, Ognjen Savkovic, Dominik Tomaszuk, Renzo Angles, Josh Perryman
Publikováno v:
ACM Special Interest Group on Management of Data (SIGMOD)
ACM Special Interest Group on Management of Data (SIGMOD), Jun 2021, Xi'an, China. ⟨10.1145/3448016.3457561⟩
Angles, R, Bonifati, A, Dumbrava, S, Fletcher, G, Hare, K W, Hidders, J, Lee, V E, Li, B, Libkin, L, Martens, W, Murlak, F, Perryman, J, Savković, O, Schmidt, M, Sequeda, J, Staworko, S & Tomaszuk, D 2021, PG-Keys: Keys for Property Graphs . in Proceedings of the 2021 International Conference on Management of Data (SIGMOD ’21) . pp. 2423-2436, ACM SIGMOD/PODS International Conference on Management Data, Xi'an, China, 20/06/21 . https://doi.org/10.1145/3448016.3457561
SIGMOD Conference
ACM Special Interest Group on Management of Data (SIGMOD), Jun 2021, Xi'an, China. ⟨10.1145/3448016.3457561⟩
Angles, R, Bonifati, A, Dumbrava, S, Fletcher, G, Hare, K W, Hidders, J, Lee, V E, Li, B, Libkin, L, Martens, W, Murlak, F, Perryman, J, Savković, O, Schmidt, M, Sequeda, J, Staworko, S & Tomaszuk, D 2021, PG-Keys: Keys for Property Graphs . in Proceedings of the 2021 International Conference on Management of Data (SIGMOD ’21) . pp. 2423-2436, ACM SIGMOD/PODS International Conference on Management Data, Xi'an, China, 20/06/21 . https://doi.org/10.1145/3448016.3457561
SIGMOD Conference
International audience; We report on a community effort between industry and academia to shape the future of property graph constraints. The standardization for a property graph query language is currently underway through the ISO Graph Query Languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df18458f47b9c9961f4b621a570b207f
https://inria.hal.science/hal-03189192/document
https://inria.hal.science/hal-03189192/document
Publikováno v:
WWW (Companion Volume)
It has been observed in several works that the ranking of candidates based on their score can be biased for candidates belonging to the minority community. In recent works, the fairness-aware representative ranking was proposed for computing fairness
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a02fdac18d62f55ede5092c961d6d60
https://doi.org/10.1145/3442442.3453458
https://doi.org/10.1145/3442442.3453458
Publikováno v:
ICDE
We study the problem of temporal-clique subgraph pattern matching. In such patterns, edges are required to jointly overlap in time within a given temporal window in addition to forming a topological sub-structure. This problem arises in many applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::002789c5630d059aac80307945c402b0
https://doi.org/10.1109/icde51399.2021.00064
https://doi.org/10.1109/icde51399.2021.00064
Autor:
Matt Coler, Anil Yaman, Decebal Constantin Mocanu, George H. L. Fletcher, Giovanni Iacca, Mykola Pechenizkiy
Publikováno v:
ArXiv. Cornell University Press
arXiv, 2019:1904.01709v1. Cornell University Library
Evolutionary Computation, 29(3), 391-414. MIT Press Journals
Evolutionary Computation. MIT Press
Pure TUe
arXiv, 2019:1904.01709v1. Cornell University Library
Evolutionary Computation, 29(3), 391-414. MIT Press Journals
Evolutionary Computation. MIT Press
Pure TUe
A fundamental aspect of learning in biological neural networks is the plasticity property which allows them to modify their configurations during their lifetime. Hebbian learning is a biologically plausible mechanism for modeling the plasticity prope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ddcf712d7f263f2ded5b1df510ca76c
https://direct.mit.edu/evco/article-abstract/29/3/391/97351/Evolving-Plasticity-for-Autonomous-Learning-under?redirectedFrom=fulltext
https://direct.mit.edu/evco/article-abstract/29/3/391/97351/Evolving-Plasticity-for-Autonomous-Learning-under?redirectedFrom=fulltext