Exploració per tema "Computational complexity"
Ara es mostren els items 1-20 de 186
-
2-D Tucker is PPA complete
(2020-03)
Article
Accés obertThe 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker for all k≥2. This corrects a claim in the literature that the Tucker search ... -
A biased random key genetic algorithm for the weighted independent domination problem
(Association for Computing Machinery (ACM), 2019)
Comunicació de congrés
Accés obertThis work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed ... -
A block algorithm for the algebraic path problem and its execution on a systolic array
(Institute of Electrical and Electronics Engineers (IEEE), 1989)
Text en actes de congrés
Accés obertThe solution of the algebraic path problem (APP) for arbitrarily sized graphs by a fixed-size systolic array processor (SAP) is addressed. The APP is decomposed into two subproblems, and SAP is designed for each one. Both ... -
A case for merging the ILP and DLP paradigms
(Institute of Electrical and Electronics Engineers (IEEE), 1998)
Text en actes de congrés
Accés obertThe goal of this paper is to show that instruction level parallelism (ILP) and data-level parallelism (DLP) can be merged in a single architecture to execute vectorizable code at a performance level that can not be achieved ... -
A combinatorial technique for separating counting complexity classes
(1988)
Report de recerca
Accés obertWe introduce a new combinatorial technique to obtain relativized separations of certain complexity classes related to the idea of counting, like PP, G (exact counting), and ¿P (parity). To demonstrate its usefulness we ... -
A fast OFDM-CDMA user demultiplexing architecture
(Institute of Electrical and Electronics Engineers (IEEE), 2000)
Text en actes de congrés
Accés obertA fast algorithm based on a butterfly structure is presented that demultiplexes the symbols of a particular type of MC-MA (multi-carrier multiple-access) modulation previously proposed for indoor radio communications. A ... -
A first-order isomorphism theorem
(1992)
Report de recerca
Accés obertWe show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. -
A logic programming approach to parsing and production in fluid construction grammar
(Springer, 2012)
Capítol de llibre
Accés restringit per política de l'editorialThis paper presents a Logic Programming approach to parsing and production in Fluid Construction Grammar (FCG). It builds on previous work on the formalisation of FCG in terms of First Order Logic (FOL) concepts, more ... -
A mathematical formulation of the loop pipelining problem
(Universitat Politècnica de Catalunya (UPC), 1996)
Text en actes de congrés
Accés obertThis paper presents a mathematical model for the loop pipelining problem that considers several parameters for optimization and supports any combination of resource and timing constraints. The unrolling degree of the loop ... -
A note on the query complexity of learning DFA
(1992)
Report de recerca
Accés obertIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries ... -
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
(Association for Computing Machinery (ACM), 2018)
Text en actes de congrés
Accés obertThe complexity of the parameterized halting problem for nondeterministic Turing machines p-Halt is known to be related to the question of whether there are logics capturing various complexity classes [10]. Among others, ... -
A performance characterization of high definition digital video decoding using H.264/AVC
(Institute of Electrical and Electronics Engineers (IEEE), 2005)
Text en actes de congrés
Accés obertH.264/AVC is a new international video coding standard that provides higher coding efficiency with respect to previous standards at the expense of a higher computational complexity. The complexity is even higher when ... -
A positive relativization of polynomial time vs. polylog space
(1991-05)
Report de recerca
Accés obertCan every set in P be solved in polylogarithmic space? We show that this question is equivalent to asking whether the classes PSPACE and EXPTIME are always equal under relativization. We use an oracle access mechanism that ... -
A reduced-complexity and asymptotically efficient time-delay estimator
(ICASSP, 2000)
Text en actes de congrés
Accés obertThis paper considers the problem of estimating the time delays of multiple replicas of a known signal received by an array of antennas. Under the assumptions that the noise and co-channel interference (CCI) are spatially ... -
A study of the human-system interface complexity sources in wastewater treatment plants
(Universidad de Zaragoza, 2012)
Text en actes de congrés
Accés restringit per política de l'editorialIn human-automation interaction it is necessary to define methods and tools to assess the human-system interface complexity. In a first assessment, the use of an evaluation questionnaire aiming at detecting complexity ... -
A tutorial on the characterisation and modelling of low layer functional splits for flexible radio access networks in 5G and beyond
(Institute of Electrical and Electronics Engineers (IEEE), 2023-10)
Article
Accés obertThe centralization of baseband (BB) functions in a radio access network (RAN) towards data processing centres is receiving increasing interest as it enables the exploitation of resource pooling and statistical multiplexing ... -
Acceleration of Born series by change of variables
(2021-09)
Article
Accés obertIn this work, we propose a method to enhance the convergence of the Born series. The Born series is widely used in scattering theory, but its convergence is only guaranteed under certain restrictive conditions which limit ... -
Adaptive logspace and depth-bounded reducibilities
(1991-04)
Report de recerca
Accés obertWe discuss a number of results regarding an important subject: the study of the computational power of depth-bounded reducibilities, their use to classify the complexity of computational problems, and their characterizations ... -
Adaptive logspace reducibility and parallel time
(1991-11)
Report de recerca
Accés obertWe discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still ... -
Affine projection subspace tracking
(Institute of Electrical and Electronics Engineers (IEEE), 2021)
Comunicació de congrés
Accés obertIn this paper, we consider the problem of estimating and tracking an R-dimensional subspace with relevant information embedded in an N-dimensional ambient space, given that N>>R. We focus on a formulation of the signal ...