Enviaments recents

  • Identifiability and transportability in dynamic causal networks 

    Blondel, Gilles; Arias Vicente, Marta; Gavaldà Mestre, Ricard (2016)
    Report de recerca
    Accés obert
    In 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 

    Morrill, Glyn; Merenciano Saladrigas, Josep Maria (1996-01)
    Report de recerca
    Accés obert
    This 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 

    Quadrana, Massimo; Bifet Figuerol, Albert Carles; Gavaldà Mestre, Ricard (2013)
    Report de recerca
    Accés obert
    Mining 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 

    Berral, Josep Ll.; Gavaldà Mestre, Ricard; Torres Viñals, Jordi (2013)
    Report de recerca
    Accés obert
    Cloud 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 ...
  • The Plogi and ACi-1 operators on the polynomial time hierarchy 

    Castro Rabal, Jorge; Seara Ojea, Carlos (1993-11)
    Report de recerca
    Accés obert
    In a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ...
  • Syntactic connectivity 

    Morrill, Glyn (1998-03)
    Report de recerca
    Accés obert
    Type logical grammar presents a paradigm of linguistic description based on what we may refer to as a Lambek-van Benthem correspondence: (logical) formulas as (linguistic) categories. Lexical signs are classified ...
  • Memoisation of categorial proof nets: parallelism in categorial processing 

    Morrill, Glyn (1996-02)
    Report de recerca
    Accés obert
    We introduce a method of memoisation of categorial proof nets. Exploiting the planarity of non-commutative proof nets, and unifiability as a correctness criterion, parallelism is simulated through construction of a ...
  • Learnability of Kolmogorov-easy circuit expressions via queries 

    Balcázar Navarro, José Luis; Buhrman, H; Hermo, M (1995-02)
    Report de recerca
    Accés obert
    Circuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We ...
  • Higher-order linear logic programming of categorial deduction 

    Morrill, Glyn (1994-10)
    Report de recerca
    Accés obert
    We show how categorial deduction can be implemented in (higher-order) linear logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of ...
  • Incremental processing and acceptability 

    Morrill, Glyn (1998-09)
    Report de recerca
    Accés obert
    We present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly ...

Mostra'n més