LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

 

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.

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.

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.

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.

Recent Submissions

  • Weak-type and end-point norm estimates for Hardy operators 

    Boza Rocho, Santiago; Soria de Diego, Francisco Javier (2020-11)
    Article
    Restricted access - publisher's policy
    We explicitly calculate the best constants for weak-type and other end-point estimates for the Hardy operator and its adjoint. In particular, we find the right value for decreasing power weights, fixing some previously ...

  • Refining indeterministic choice: Imprecise probabilities and strategic thinking 

    Castro Rabal, Jorge; Gabarró Vallès, Joaquim; Serna Iglesias, María José (2020-11)
    Article
    Open Access
    Often, uncertainty is present in processes that are part of our routines. Having tools to understand the consequences of unpredictability is convenient. We introduce a general framework to deal with uncertainty in the realm ...

  • Is classroom gamification opposed to performance? 

    Hernández Fernández, Antonio; Olmedo Torre, Noelia; Peña Carrera, Marta (2020-11-28)
    Article
    Open Access
    Learning through digital media is currently considered as a mixture of methodologies that aim to approach the reality of students to motivate them. Gamification emerges as one of the pedagogical methodologies on the rise ...

  • Optimal coding and the origins of Zipfian laws 

    Ferrer Cancho, Ramon; Bentz, Christian; Seguin, Caio (Informa UK (Taylor & Francis), 2020-07-24)
    Article
    Restricted access - publisher's policy
    The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding – under an arbitrary coding scheme – and show that it ...

  • Edge crossings in random linear arrangements 

    Alemany Puig, Lluís; Ferrer Cancho, Ramon (Institute of Physics (IOP), 2020-02-19)
    Article
    Restricted access - publisher's policy
    In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1D lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. ...

  • Cap a l'educació tecnològica 

    Hernández Fernández, Antonio (Institut d'Estudis Catalans (IEC), 2020-11)
    Article
    Open Access
    En aquest article s’apunta la necessitat d’una educació tecnològica que inclogui la filosofia de la tecnologia i la reflexió tecnoètica a l’educació secundària obligatòria, en la línia del pensament bungeà, i que vagi més ...

  • Adaptive logspace reducibility and parallel time 

    Álvarez Faura, M. del Carme; Balcázar Navarro, José Luis; Jenner, Birgit (1991-11)
    External research report
    Open Access
    We 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 ...

  • Linguistic laws in speech: The case of Catalan and Spanish 

    Hernández Fernández, Antonio; González Torre, Iván; Garrido Almiñana, Juan Maria; Lacasa, Lucas (MDPI, 2020-08)
    Part of book or chapter of book
    Open Access
    In this work we consider Glissando Corpus—an oral corpus of Catalan and Spanish—and empirically analyze the presence of the four classical linguistic laws (Zipf’s law, Herdan’s law, Brevity law, and Menzerath–Altmann’s ...

  • Cuatro consideraciones para la enseñanza en la pandemia 

    Hernández Fernández, Antonio (2020-09-01)
    Article
    Open Access
    La pandemia de la COVID-19 ha provocado la mayor disrupción en los sistemas educativos de la historia de la Humanidad, según el informe de este agosto de 2020 de las Naciones Unidas. En el mejor de los casos se ha dado ...

  • An approach to correctness of data parallel algorithms 

    Gabarró Vallès, Joaquim; Gavaldà Mestre, Ricard (1991-05)
    External research report
    Open Access
    The design of data parallel algorithms for fine-grained SIMD machines is a fundamental domain in today computer science. High standards in the specification and resolution of problems have been achieved in the sequential ...

  • Evaluar con juegos: herramientas y métodos para una evaluación diversificada en la ludificación 

    Hernández Fernández, Antonio (2020-08)
    Article
    Open Access
    En este trabajo se presentan algunas herramientas y consideraciones metodológicas sobre la evaluación mediante actividades y herramientas ludificadas. Más específicamente, se defenderá la mezcla de dinámicas y diferentes ...

  • A positive relativization of polynomial time vs. polylog space 

    Gavaldà Mestre, Ricard (1991-05)
    External research report
    Open Access
    Can 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 ...

View more