Zobrazeno 1 - 10
of 220
pro vyhledávání: '"Eli Upfal"'
Publikováno v:
Algorithms for Molecular Biology, Vol 14, Iss 1, Pp 1-11 (2019)
Abstract Problem We study the problem of identifying differentially mutated subnetworks of a large gene–gene interaction network, that is, subnetworks that display a significant difference in mutation frequency in two sets of cancer samples. We for
Externí odkaz:
https://doaj.org/article/821d957a84d6460388d72201b1d53d8a
Publikováno v:
Algorithms, Vol 13, Iss 9, p 216 (2020)
We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decom
Externí odkaz:
https://doaj.org/article/cb8ac5b3f70c40c08c2de66f18f0c972
Autor:
Alessandro Epasto, Eli Upfal
Publikováno v:
Algorithms, Vol 11, Iss 6, p 84 (2018)
Covering the edges of a bipartite graph by a minimum set of bipartite complete graphs (bicliques) is a basic graph theoretic problem, with numerous applications. In particular, it is used to characterize parsimonious models of a set of observations (
Externí odkaz:
https://doaj.org/article/4a4904d85b42492cb1d876ac2c3f1b10
Publikováno v:
PLoS Computational Biology, Vol 11, Iss 5, p e1004071 (2015)
A key challenge in genomics is to identify genetic variants that distinguish patients with different survival time following diagnosis or treatment. While the log-rank test is widely used for this purpose, nearly all implementations of the log-rank t
Externí odkaz:
https://doaj.org/article/f6927eb8b814463fa65da84839e85508
Publikováno v:
Data Mining and Knowledge Discovery. 36:2334-2378
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a60b7f2a85760f7d1882993c841caa0
https://doi.org/10.1007/s10618-022-00875-8
https://doi.org/10.1007/s10618-022-00875-8
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 15:1-52
We introduce Tiered Sampling , a novel technique for estimating the count of sparse motifs in massive graphs whose edges are observed in a stream. Our technique requires only a single pass on the data and uses a memory of fixed size M , which can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4b07301740f6e4dad6c4df24a23ce60
https://doi.org/10.1145/3441299
https://doi.org/10.1145/3441299
Autor:
Eli Upfal, Ahmad Mahmoody
Publikováno v:
Theoretical Computer Science. 774:14-30
We formulate and study a fundamental search and detection problem, Schedule Optimization , motivated by a variety of real-world applications, ranging from monitoring content changes on the web, social networks, and user activities to detecting failur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4736ef1f2125a1f54c4bde6c784d8931
https://doi.org/10.1016/j.tcs.2016.05.041
https://doi.org/10.1016/j.tcs.2016.05.041
The topology of the hyperlink graph among pages expressing different opinions may influence the exposure of readers to diverse content. Structural bias may trap a reader in a polarized bubble with no access to other opinions. We model readers' behavi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c2181264752d0aed7ef8479b9636649
Publikováno v:
Proceedings of the 2021 IEEE International Conference on Big Data (IEEE BigData 2021)
2021 IEEE International Conference on Big Data (Big Data)
2021 IEEE International Conference on Big Data (Big Data)
Wikipedia relies on an extensive review process to verify that the content of each individual page is unbiased and presents a neutral point of view. Less attention has been paid to possible biases in the hyperlink structure of Wikipedia, which has a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff00aa2f94d715506215a620653b787e
http://arxiv.org/abs/2007.08197
http://arxiv.org/abs/2007.08197