Results 11 to 20 of about 871,423 (283)
On Characterizing the Data Access Complexity of Programs [PDF]
, 2014 Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no longer be a sufficient metric for comparing algorithms, and a fundamental ...
Bilardi G. +5 more
core +5 more sources
On the Average-case Complexity of Parameterized Clique [PDF]
, 2014 The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems.
Bollobás +22 more
core +2 more sources
Adiabatic Quantum State Generation and Statistical Zero Knowledge [PDF]
, 2003 The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'.
Aharonov, Dorit, Ta-Shma, Amnon
core +9 more sources
Computational RNA secondary structure design: empirical complexity and improved methods
BMC Bioinformatics, 2007 Background We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various classes of RNA structures as the size of the target structure is increased ...
Condon Anne +2 more
doaj +1 more source
Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems [PDF]
, 2006 Most existing work on adaptive allocation of subcarriers and power in multiuser orthogonal frequency division multiplexing (OFDM) systems has focused on homogeneous traffic consisting solely of either delay-constrained data (guaranteed service) or non ...
Liang, Ying-Chang +2 more
core +2 more sources
Generalized Queue-Aware Resource Management and Scheduling for Wireless Communications
IEEE Access, 2015 The general problem of a queue-aware radio resource management and scheduling design is investigated for wireless communications under quasi-static fading channel conditions.
Ning Wang +3 more
doaj +1 more source
Joint likelihood estimation and model order selection for outlier censoring
IET Radar, Sonar & Navigation, 2021 This study deals with the problem of outlier censoring from the secondary data in a radar scenario, where the number of outliers is unknown. To this end, a procedure consisting of joint likelihood estimation and statistical model order selection (MOS) is
Seyed Mohammad Karbasi
doaj +1 more source
Mathematics, 2022 In the supervised classification area, the algorithm selection problem (ASP) refers to determining the a priori performance of a given classifier in some specific problem, as well as the finding of which is the most suitable classifier for some tasks ...
Claudia C. Tusell-Rey +5 more
doaj +1 more source
Tight Bounds for Asymptotic and Approximate Consensus [PDF]
, 2018 We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a common value ...
Bliman Pierre-Alexandre +4 more
core +3 more sources
Solving systems of phaseless equations via Kaczmarz methods: A proof of concept study [PDF]
, 2015 We study the Kaczmarz methods for solving systems of quadratic equations, i.e., the generalized phase retrieval problem. The methods extend the Kaczmarz methods for solving systems of linear equations by integrating a phase selection heuristic in each ...
Wei, Ke
core +1 more source