LARCA és un grup de recerca de nivell internacional en temes
d'aprenentatge i mineria de dades, anàlisi de dades i lingüística matemàtica. Típicament, abordem els problemes des de principis matemàtics sòlids, usant eines de modelització i tècniques de l'algorísmia, complexitat computacional, teoria d'autòmats, lògica, matemàtica discreta, estadística, i sistemes dinàmics. Estem iniciant
col·laboracions amb empreses i altres institucions per tal d'aplicar les nostres solucions al problemes del món real.

http://futur.upc.edu/LARCA

LARCA es un grupo de investigación de nivel internacional en temas de aprendizaje y minería de datos, análisis de datos y lingüística matemática. Típicamente, abordamos los problemas desde principios matemáticos sólidos, usando técnicas de modelización de la algoritmia, la complejidad computacional, teoría de autómatas, lógica, matemática discreta, estadística y sistemas dinámicos. Estamos iniciando colaboraciones con empresas e instituciones para la aplicación de nuestras soluciones a contextos reales.

http://futur.upc.edu/LARCA

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

http://futur.upc.edu/LARCA

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

http://futur.upc.edu/LARCA

Enviaments recents

  • A reply to Kubota and Levine on gapping 

    Valentín Fernández Gallart, José Oriol; Morrill, Glyn (2017-02)
    Article
    Accés restringit per política de l'editorial
    In a series of papers Kubota and Levine give an account of gapping and determiner gapping in terms of hybrid type logical grammar, including anomalous scopal interactions with auxiliaries and negative quantifiers. We make ...
  • 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 ...
  • Rehabilitation profiles of older adult stroke survivors admitted to intermediate care units: A multi-centre study 

    Pérez, Laura M.; Inzitari, Marco; Quinn, Terence J.; Montaner, Joan; Gavaldà Mestre, Ricard; Duarte, Esther; Coll Planas, Laura; Cerdá, Mercé; Santaeugenia, Sebastia; Closa, Conxita; Gallofre, Miquel (2016-11-09)
    Article
    Accés obert
    Background: Stroke is a major cause of disability in older adults, but the evidence around post-acute treatment is limited and heterogeneous. We aimed to identify profiles of older adult stroke survivors admitted to ...
  • 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