Results 31 to 40 of about 426,747 (281)
On the SCALE Algorithm for Multiuser Multicarrier Power Spectrum Management [PDF]
, 2012 This paper studies the successive convex approximation for low complexity (SCALE) algorithm, which was proposed to address the weighted sum rate (WSR) maximized dynamic power spectrum management (DSM) problem for multiuser multicarrier systems.
Vandendorpe, Luc, Wang, Tao
core +1 more source
Students’ Success Prediction based on Bayes Algorithms
International Journal of Computer Applications, 2017 Prediction in data mining is a sophisticated task that is conducted in various disciplines. Given that the overall success of educational institutions can be measured by their students’ success, many studies are dedicated to predicting it. This paper provides a model of student’s success prediction based on Bayes algorithms and suggests the best ...
Alaa Khalaf Hamoud +3 more
openaire +1 more source
Full-Duplex Multi-Hop Wireless Networks Optimization with Successive Interference Cancellation
Sensors, 2018 In wireless network communication, in-band full-duplex technique is a useful and important technique that can enlarge the whole throughput of the wireless networks. However, its use needs harsh environment.
Lei Shi +4 more
doaj +1 more source
Minimum mean-squared error iterative successive parallel arbitrated decision feedback detectors for DS-CDMA systems [PDF]
, 2008 In this paper we propose minimum mean squared error (MMSE) iterative successive parallel arbitrated decision feedback (DF) receivers for direct sequence code division multiple access (DS-CDMA) systems.
de Lamare, Rodrigo C. +1 more
core +3 more sources
Electing Successive Committees: Complexity and Algorithms
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 We introduce successive committees elections. The point is that our new model additionally takes into account that “committee members” shall have a short term of office possibly over a consecutive time period (e.g., to limit the influence of elitist power cartels or to keep the social costs of overloading committees as small as possible) but at the ...
Robert Bredereck +2 more
openaire +2 more sources
Smoothed Analysis of the Successive Shortest Path Algorithm [PDF]
SIAM Journal on Computing, 2015 The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem and the algorithms are well understood.
Tobias Brunsch +4 more
openaire +4 more sources
Bit-Flip Algorithm for Successive Cancellation List Decoder of Polar Codes
IEEE Access, 2019 A successive cancellation list (SCL) decoder with the assistance of a cyclic redundancy check (CRC) can provide competitive decoding performance for polar codes compared with the state-of-the-art codes.
Fengyi Cheng +3 more
doaj +1 more source
A Reduced Latency List Decoding Algorithm for Polar Codes
, 2014 Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm.
Lin, Jun, Xiong, Chenrong, Yan, Zhiyuan
core +1 more source
Successive Projection Algorithm Robust to Outliers [PDF]
2019 IEEE 8th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2019 8 pages, 2 ...
openaire +2 more sources
An efficient algorithm for positive realizations
, 2007 We observe that successive applications of known results from the theory of positive systems lead to an {\it efficient general algorithm} for positive realizations of transfer functions.
Anderson +25 more
core +4 more sources