English
Related papers

Related papers: Study of Interference Cancellation and Relay Selec…

200 papers

We propose a variable decomposition algorithm -greedy block coordinate descent (GBCD)- in order to make dense Gaussian process regression practical for large scale problems. GBCD breaks a large scale optimization into a series of small…

Machine Learning · Computer Science 2012-06-18 Liefeng Bo , Cristian Sminchisescu

The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy…

Data Structures and Algorithms · Computer Science 2021-11-16 Jason Altschuler , Aditya Bhaskara , Gang Fu , Vahab Mirrokni , Afshin Rostamizadeh , Morteza Zadimoghaddam

This paper considers a Massive multiple-input multiple-output (MIMO) network, where the base station (BS) with a large number of antennas communicates with a smaller number of users. The signals are transmitted using frequency division…

Information Theory · Computer Science 2018-04-24 Manijeh Bashar , Alister G. Burr , Katsuyuki Haneda Kanapathippillai Cumanan

This paper is on relay selection in uplink of an in-band full-duplex (IBFD) cooperative cellular network. Assuming an orthogonal frequency division multiple access (OFDMA) cellular network, we develop a relay selection and resource…

Information Theory · Computer Science 2017-02-09 Jafar Banar , S. Mohammad Razavizadeh

We study the problem that requires a team of robots to perform joint localization and target tracking task while ensuring team connectivity and collision avoidance. The problem can be formalized as a nonlinear, non-convex optimization…

Robotics · Computer Science 2022-10-12 Rahul Zahroof , Jiazhen Liu , Lifeng Zhou , Vijay Kumar

Opportunistic relay selection (ORS) has been recognized as a simple but efficient method for mobile nodes to achieve cooperative diversity in slow fading channels. However, the wrong selection of the best relay arising from outdated channel…

Information Theory · Computer Science 2021-02-09 Wei Jiang , Hans Dieter Schotten

In cooperative localization, communicating mobile agents use inter-agent relative measurements to improve their dead-reckoning-based global localization. Measurement scheduling enables an agent to decide which subset of available…

Robotics · Computer Science 2021-12-07 Jianan Zhu , Solmaz S. Kia

This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is…

Machine Learning · Statistics 2012-06-08 Ali Jalali , Sujay Sanghavi

When solving PDEs, classical numerical solvers are often computationally expensive, while machine learning methods can suffer from spectral bias, failing to capture high-frequency components. Designing an optimal hybrid iterative…

Methodology · Statistics 2026-05-08 Sahana Rayan , Yash Patel , Ambuj Tewari

Random search processes are instrumental in studying and understanding navigation properties of complex networks, food search strategies of animals, diffusion control of molecular processes in biological cells, and improving web search…

Social and Information Networks · Computer Science 2016-01-27 Igor Trpevski , Ljupco Kocarev

A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit…

Information Theory · Computer Science 2020-12-29 Huimei Han , Lushun Fang , Weidang Lu , Wenchao Zhai , Ying Li , Jun Zhao

Neighbor discovery (ND) is a key step in wireless ad hoc network, which directly affects the efficiency of wireless networking. Improving the speed of ND has always been the goal of ND algorithms. The classical ND algorithms lose packets…

Networking and Internet Architecture · Computer Science 2023-10-11 Zhiqing Wei , Yueyue Liang , Zeyang Meng , Zhiyong Feng , Kaifeng Han , Huici Wu

We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy…

Machine Learning · Computer Science 2022-03-29 Louis Ly , Yen-Hsi Richard Tsai

In this paper, we consider the problem of iterative detection and decoding (IDD) for multi-antenna systems using low-density parity-check (LDPC) codes. The proposed IDD system consists of a soft-input soft-output parallel interference (PIC)…

Information Theory · Computer Science 2013-04-24 Jingjing Liu , Peng Li , Rodrigo C. de Lamare

Given a set ${\cal R}=\{R_1,R_2,..., R_n\}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independent set (MIS) for the intersection graph $G({\cal R})$ of the…

Computational Geometry · Computer Science 2012-12-05 Ritankar Mandal , Anirban Ghosh , Sasanka Roy , Subhas C. Nandy

This paper investigates the covert communications via cooperative jamming and relay selection in a wireless relay system, where a source intends to transmit a message to its destination with the help of a selected relay, and a warden…

Information Theory · Computer Science 2023-03-15 Chan Gao , Bin Yang , Dong Zheng , Xiaohong Jiang , Tarik Taleb

In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate…

Information Theory · Computer Science 2020-11-19 X. Lu , R. C. de Lamare

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed…

Networking and Internet Architecture · Computer Science 2016-11-17 Virag Shah , Neelesh B. Mehta , Raymond Yim

The scope of this work is twofold: On the one hand, strongly motivated by emerging engineering issues in multiple access communication systems, we investigate the performance of a slotted-time relay-assisted cooperative random access…

Probability · Mathematics 2018-10-02 Mayank Saxena , Ioannis Dimitriou , Stella Kapodistria

Massive MIMO systems can achieve high spectrum and energy efficiency in downlink (DL) based on accurate estimate of channel state information (CSI). Existing works have developed learning-based DL CSI estimation that lowers uplink feedback…

Information Theory · Computer Science 2022-05-31 Yu-Chien Lin , Ta-Sung Lee , Zhi Ding
‹ Prev 1 3 4 5 6 7 10 Next ›