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

  • Adarules: Learning rules for real-time road-traffic prediction 

    Mena Yedra, Rafael; Gavaldà Mestre, Ricard; Casas Vilaró, Jordi (Elsevier, 2017-12-17)
    Text en actes de congrés
    Accés obert
    Traffic management is being more important than ever, especially in overcrowded big cities with over-pollution problems and with new unprecedented mobility changes. In this scenario, road-traffic prediction plays a key ...
  • Parsing logical grammar: CatLog3 

    Morrill, Glyn (Stockholm University, 2017)
    Text en actes de congrés
    Accés obert
    CatLog3 is a Prolog parser/theorem-prover for (type) logical (categorial) grammar. In such logical grammar, grammar is reduced to logic: a string of words is grammatical if and only if an associated logical statement is a ...
  • A polynomial-time algorithm for the Lambek calculus with brackets of bounded order 

    Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre (Dagstuhl Publishing, 2017)
    Text en actes de congrés
    Accés obert
    Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth ...
  • Does like seek like? The formation of working groups in a programming project 

    Sanou Gozalo, Eduard; Hernández Fernández, Antonio; Arias Vicente, Marta; Ferrer Cancho, Ramon (Omnia Publisher SL (OmniaScience), 2017-02)
    Article
    Accés obert
    In a course of the degree of computer science, the programming project has changed from individual to teamed work, tentatively in couples (pair programming). Students have full freedom to team up with minimum intervention ...
  • Scarcity of crossing dependencies: A direct outcome of a specific constraint? 

    Gómez Rodríguez, Carlos; Ferrer Cancho, Ramon (American Chemical Society (ACS), 2017-12-04)
    Article
    Accés obert
    The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human ...
  • Are crossing dependencies really scarce? 

    Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos; Esteban Ángeles, Juan Luis (2018-03-01)
    Article
    Accés restringit per política de l'editorial
    The syntactic structure of a sentence can be modelled as a tree, where vertices correspond to words and edges indicate syntactic dependencies. It has been claimed recurrently that the number of edge crossings in real ...
  • Methods of class field theory to separate logics over finite residue classes and circuit complexity 

    Arratia Quesada, Argimiro Alejandro; Ortiz, Carlos E. (2017-02-27)
    Article
    Accés restringit per política de l'editorial
    Separations among the first-order logic Res(0,+,×) of finite residue classes, its extensions with generalized quantifiers, and in the presence of a built-in order are shown in this article, using algebraic methods from ...
  • Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1984)
    Report de recerca
    Accés obert
    We 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 

    Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (1985-11)
    Report de recerca
    Accés obert
    We 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 

    Balcázar Navarro, José Luis (1985)
    Report de recerca
    Accés obert
    Un 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 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    Non-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 ...

Mostra'n més