English
Related papers

Related papers: On Finding Sub-optimum Signature Matrices for Over…

200 papers

Feature selection is the process of identifying statistically most relevant features to improve the predictive capabilities of the classifiers. To find the best features subsets, the population based approaches like Particle Swarm…

Neural and Evolutionary Computing · Computer Science 2018-06-28 Naresh Mallenahalli , T. Hitendra Sarma

Even though simultaneous optimization of similarity metrics is a standard procedure in the field of semantic segmentation, surprisingly, this is much less established for image registration. To help closing this gap in the literature, we…

In this paper, we propose a novel binary-based cost computation and aggregation approach for stereo matching problem. The cost volume is constructed through bitwise operations on a series of binary strings. Then this approach is combined…

Computer Vision and Pattern Recognition · Computer Science 2014-02-11 Kang Zhang , Jiyang Li , Yijing Li , Weidong Hu , Lifeng Sun , Shiqiang Yang

Sparse code multiple access (SCMA) is the most concerning scheme among non-orthogonal multiple access (NOMA) technologies for 5G wireless communication new interface. Another efficient technique in 5G aimed to improve spectral efficiency…

Information Theory · Computer Science 2022-09-22 Yukai Liu , Wen Chen

In many global Optimization Problems, it is required to evaluate a global point (min or max) in large space that calculation effort is very high. In this paper is presented new approach for optimization problem with subdivision labeling…

Neural and Evolutionary Computing · Computer Science 2013-07-24 Masoumeh Vali

This paper proposes a unified framework for the global optimization of a continuous function in a bounded rectangular domain. Specifically, we show that: (1) under the optimal strategy for a two-armed decision model, the sample mean…

Optimization and Control · Mathematics 2025-11-11 Xiaohong Chen , Zengjing Chen , Wayne Yuan Gao , Xiaodong Yan , Guodong Zhang

Statistical mechanics approach is useful not only in analyzing macroscopic system performance of wireless communication systems, but also in discussing design problems of wireless communication systems. In this paper, we discuss a design…

Information Theory · Computer Science 2008-10-02 Koichiro Kitagawa , Toshiyuki Tanaka

In this paper we describe improvements to the particle swarm optimizer (PSO) made by inclusion of an unscented Kalman filter to guide particle motion. We demonstrate the effectiveness of the unscented Kalman filter PSO by comparing it with…

Neural and Evolutionary Computing · Computer Science 2018-03-21 Chengjia Wang , Keith A. Goatman , James Boardman , Erin Beveridge , David Newby , Scott Semple

In this paper, a downlink communication system, in which a Base Station (BS) equipped with $M$ antennas communicates with $N$ users each equipped with $K$ receive antennas, is considered. An efficient suboptimum algorithm is proposed for…

Information Theory · Computer Science 2007-07-13 Alireza Bayesteh , Amir Keyvan Khandani

Coverage of image features play an important role in many vision algorithms since their distribution affect the estimated homography. This paper presents a Genetic Algorithm (GA) in order to select the optimal set of features yielding…

Computer Vision and Pattern Recognition · Computer Science 2017-04-21 Erkan Bostanci

In the present paper we investigate methods related to both the Singular Spectrum Analysis (SSA) and subspace-based methods in signal processing. We describe common and specific features of these methods and consider different kinds of…

Methodology · Statistics 2011-07-21 Nina Golyandina

As millimeter-wave (mmWave) MIMO systems adopt larger antenna arrays, near-field propagation becomes increasingly prominent, especially for users close to the transmitter. Traditional far-field beam training methods become inadequate, while…

Information Theory · Computer Science 2026-02-03 Weicao Deng , Binpu Shi , Min Li , Osvaldo Simeone

Sparse code multiple access (SCMA) is a promising technique for future machine type communication systems due to its superior spectral efficiency and capability for supporting massive connectivity. This paper proposes a novel class of…

Information Theory · Computer Science 2025-01-29 Haibo Liu , Qu Luo , Zilong Liu , Shan Luo , Pei Xiao , Xiaojun Yuan

We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This…

Data Structures and Algorithms · Computer Science 2013-11-19 Amit Chakrabarti , Sagar Kale

We consider asynchronous CDMA systems in no-fading environments with a particular focus on a certain user. This certain user is called a desired user in this paper. In such a situation, an optimal sequence, maximum Signal-to-Interference…

Information Theory · Computer Science 2019-06-11 Hirofumi Tsuda

Sparse code multiple access (SCMA) is a new multiple access technique which supports massive connectivity. Compared with the current Long Term Evolution (LTE) system, it enables the overloading of active users on limited orthogonal…

Information Theory · Computer Science 2016-11-29 Chenchen Zhang , Yuan Luo , Yan Chen

Modern state estimation is often formulated as an optimization problem and solved using efficient local search methods. These methods at best guarantee convergence to local minima, but, in some cases, global optimality can also be…

Robotics · Computer Science 2022-11-28 Connor Holmes , Timothy D. Barfoot

This paper investigates generic signal shaping methods for multiple-data-stream generalized spatial modulation (GenSM) and generalized quadrature spatial modulation (GenQSM) based on the maximizing the minimum Euclidean distance (MMED)…

Signal Processing · Electrical Eng. & Systems 2019-01-29 Shuaishuai Guo , Haixia Zhang , Peng Zhang , Shuping Dang , Liang Cong , Mohamed-Slim Alouini

We study $\textit{sparse singular value certificates}$ for random rectangular matrices. If $M$ is an $n \times d$ matrix with independent Gaussian entries, we give a new family of polynomial-time algorithms which can certify upper bounds on…

Data Structures and Algorithms · Computer Science 2024-12-31 Ilias Diakonikolas , Samuel B. Hopkins , Ankit Pensia , Stefan Tiegel

Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink…

Information Theory · Computer Science 2017-02-10 Min Li , Chunshan Liu , Stephen V. Hanly
‹ Prev 1 3 4 5 6 7 10 Next ›