Zobrazeno 1 - 10
of 985
pro vyhledávání: '"McGREGOR, ANDREW"'
As Low Earth Orbit (LEO) satellite mega constellations continue to be deployed for satellite internet and recent successful experiments in satellite-based quantum entanglement distribution emerge, a natural question arises: How should we coordinate t
Externí odkaz:
http://arxiv.org/abs/2405.09464
Autor:
McGregor, Andrew, Sengupta, Rik
We consider the problem of reconstructing an undirected graph $G$ on $n$ vertices given multiple random noisy subgraphs or "traces". Specifically, a trace is generated by sampling each vertex with probability $p_v$, then taking the resulting induced
Externí odkaz:
http://arxiv.org/abs/2405.04261
The maximum coverage problem is to select $k$ sets from a collection of sets such that the cardinality of the union of the selected sets is maximized. We consider $(1-1/e-\epsilon)$-approximation algorithms for this NP-hard problem in three standard
Externí odkaz:
http://arxiv.org/abs/2403.14087
The Graphical House Allocation problem asks: how can $n$ houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph $G$, so as to minimize the "aggregate local envy", i.e., the sum of absolute differences along t
Externí odkaz:
http://arxiv.org/abs/2307.12482
Learning causal structure is useful in many areas of artificial intelligence, including planning, robotics, and explanation. Constraint-based structure learning algorithms such as PC use conditional independence (CI) tests to infer causal structure.
Externí odkaz:
http://arxiv.org/abs/2211.06536
We study the problem of estimating the number of edges in an $n$-vertex graph, accessed via the Bipartite Independent Set query model introduced by Beame et al. (ITCS '18). In this model, each query returns a Boolean, indicating the existence of at l
Externí odkaz:
http://arxiv.org/abs/2207.02817