Reports de recerca
Enviaments recents
-
Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE
(1984)
Report de recerca
Accés obertWe find sets in the class LOGSPACE (on-line) that do not have good respectively approximations by context-free languages. For that we introduce the languages CF-bi-inmune and CF-levelable. We prove the results by defining ... -
Connections among non uniform models for problems requiring high amount of resources
(1985-11)
Report de recerca
Accés obertWe characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined ... -
Manual de POSTOFF : nueva versión
(1985)
Report de recerca
Accés obertUn programa adaptador de textos para que el formateador DSR Runoff se haga amiguete de la impresora LA100. Documentación correspondiente a la versión 3.0. Creado por José Luis Balcázar en la F.I.B. durante 1984. -
On some "non uniform" complexity measures
(1985)
Report de recerca
Accés obertNon-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several ... -
Diameter minimization in networks for SIMD machines
(1985)
Report de recerca
Accés obertWe propose an algebraic constructive method which allows to find a certain kind of networks having optimal diameter. These interconnection networks have been proposed for SIMD machines. We compare the results with other ... -
Uniform characterizations of non-uniform complexity measures
(1985)
Report de recerca
Accés obertThe class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ... -
Deriving specifications of embeddings in recursive program design
(1989)
Report de recerca
Accés obertThe design of recursive functions is a well-studied subject. Design methods require a specification to start with, however, when an embedding design is attempted at, it is not clear how the specification of the embedding ... -
Optimal distance networks of low degree for parallel computers
(1989)
Report de recerca
Accés obertWe introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance ... -
Identifiability and transportability in dynamic causal networks
(2016)
Report de recerca
Accés obertIn this paper we propose a causal analog to the purely observational Dynamic Bayesian Networks, which we call Dynamic Causal Networks. We provide a sound and complete algorithm for identification of Dynamic Causal Networks, ... -
Generalising discontinuity
(1996-01)
Report de recerca
Accés obertThis paper makes two generalisations of categorial calculus of discontinuity. In the first we introduce unary modalities which mediate between continuous and discontinuous strings. In the second each of the modes of ... -
An efficient closed frequent itemset miner for the MOA stream mining system
(2013)
Report de recerca
Accés obertMining itemsets is a central task in data mining, both in the batch and the streaming paradigms. While robust, efficient, and well-tested implementations exist for batch mining, hardly any publicly available equivalent ... -
Modeling cloud resources using machine learning
(2013)
Report de recerca
Accés obertCloud computing is a new Internet infrastructure paradigm where management optimization has become a challenge to be solved, as all current management systems are human-driven or ad-hoc automatic systems that must be tuned ...
RSS 1.0