Zobrazeno 1 - 10
of 157
pro vyhledávání: '"Mohajer, Soheil"'
In this work, we consider the sparsity-constrained community-based group testing problem, where the population follows a community structure. In particular, the community consists of $F$ families, each with $M$ members. A number $k_f$ out of the $F$
Externí odkaz:
http://arxiv.org/abs/2403.12419
Autor:
Abolpour, Milad, Salehi, MohammadJavad, Mohajer, Soheil, Shariatpanahi, Seyed Pooya, Tölli, Antti
A novel coding design is proposed to enhance information retrieval in a wireless network of users with partial access to the data, in the sense of observation, measurement, computation, or storage. Information exchange in the network is assisted by a
Externí odkaz:
http://arxiv.org/abs/2402.00465
In this paper, we investigate the problem of transmitting an analog source to a destination over $N$ uses of an additive-white-Gaussian-noise (AWGN) channel, where $N$ is very small (in the order of 10 or even less). The proposed coding scheme is bas
Externí odkaz:
http://arxiv.org/abs/2401.17419
The problem of distributed matrix-vector product is considered, where the server distributes the task of the computation among $n$ worker nodes, out of which $L$ are compromised (but non-colluding) and may return incorrect results. Specifically, it i
Externí odkaz:
http://arxiv.org/abs/2305.06526
We study a $K$-user coded-caching broadcast problem in a joint source-channel coding framework. The transmitter observes a database of files that are being generated at a certain rate per channel use, and each user has a cache, which can store a fixe
Externí odkaz:
http://arxiv.org/abs/2301.04753
To design algorithms that reduce communication cost or meet rate constraints and are robust to communication noise, we study convex distributed optimization problems where a set of agents are interested in solving a separable optimization problem col
Externí odkaz:
http://arxiv.org/abs/2210.05897
We study non-convex distributed optimization problems where a set of agents collaboratively solve a separable optimization problem that is distributed over a time-varying network. The existing methods to solve these problems rely on (at most) one tim
Externí odkaz:
http://arxiv.org/abs/2204.10974
The information-theoretic secure exact-repair regenerating codes for distributed storage systems (DSSs) with parameters $(n,k=d,d,\ell)$ are studied in this paper. We consider distributed storage systems with $n$ nodes, in which the original data can
Externí odkaz:
http://arxiv.org/abs/2201.00313
Publikováno v:
Advances in Neural Information Processing Systems 33 (NeurIPS 2020)
We consider a matrix completion problem that exploits social or item similarity graphs as side information. We develop a universal, parameter-free, and computationally efficient algorithm that starts with hierarchical graph clustering and then iterat
Externí odkaz:
http://arxiv.org/abs/2201.01728
We study the matrix completion problem that leverages hierarchical similarity graphs as side information in the context of recommender systems. Under a hierarchical stochastic block model that well respects practically-relevant social graphs and a lo
Externí odkaz:
http://arxiv.org/abs/2109.05408