Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Anastasios Sidiropoulos"'
Publikováno v:
Journal of Computational Geometry, Vol 4, Iss 1 (2013)
Let T be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles, where the area of the
Externí odkaz:
https://doaj.org/article/2db5c8ef1170496d86638221ced64852
Publikováno v:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Autor:
Laura Palmieri, Tanima Chatterjee, Anastasios Sidiropoulos, Zainab Al-Qurashi, Bhaskar DasGupta
Publikováno v:
Journal of Combinatorial Optimization. 40:512-546
Partisan gerrymandering is a major cause for voter disenfranchisement in United States. However, convincing US courts to adopt specific measures to quantify gerrymandering has been of limited success to date. Recently, Stephanopoulos and McGhee in se
Autor:
Igor Fortel, Mitchell Butler, Laura E. Korthauer, Liang Zhan, Olusola Ajilore, Anastasios Sidiropoulos, Yichao Wu, Ira Driscoll, Dan Schonfeld, Alex Leow
Publikováno v:
Network neuroscience (Cambridge, Mass.). 6(2)
Neural activity coordinated across different scales from neuronal circuits to large-scale brain networks gives rise to complex cognitive functions. Bridging the gap between micro- and macroscale processes, we present a novel framework based on the ma
Autor:
Harald Räcke, Anupam Gupta, Kedar Dhamdhere, Anastasios Sidiropoulos, Mihai Badoiu, Yuri Rabinovich, Piotr Indyk, R. Ravi
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:454-473
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the 2-dimensional plane. Among other results, we give an $O(\sqrt{n})$-approximation alg...
Publikováno v:
Proceedings of the VLDB Endowment. 12:292-306
Parallel aggregation is a ubiquitous operation in data analytics that is expressed as GROUP BY in SQL, reduce in Hadoop, or segment in TensorFlow. Parallel aggregation starts with an optional local pre-aggregation step and then repartitions the inter
Publikováno v:
NAACL-HLT
Deep Learning-based NLP systems can be sensitive to unseen tokens and hard to learn with high-dimensional inputs, which critically hinder learning generalization. We introduce an approach by grouping input words based on their semantic diversity to s
Ensuring fairness in computational problems has emerged as a $key$ topic during recent years, buoyed by considerations for equitable resource distributions and social justice. It $is$ possible to incorporate fairness in computational problems from se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dc2b3d8d6afd3e5a8760b82f29d5ffc
http://arxiv.org/abs/2007.08069
http://arxiv.org/abs/2007.08069
Publikováno v:
ACM Transactions on Algorithms. 14:1-20
The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is $\mathrm{NP}$-hard to approximate the Gromov-Hausdorff distance better than a factor of $3$ for geodesic metrics on a pair of trees
Publikováno v:
Theory of Computing. 13:1-47
The genus of a graph is a very basic parameter in topological graph theory, that has been the subject of extensive study. Perhaps surprisingly, despite its importance, the problem of approximating the genus of a graph is very poorly understood. It ha