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 commentary on “The now-or-never bottleneck: a fundamental constraint on language”, by Christiansen and Chater (2016) 

    Ferrer Cancho, Ramon (RAM-Verlag, 2017-07-02)
    Article
    Accés obert
    In a recent article, Christiansen and Chater (2016) present a fundamental constraint on language, i.e. a now-or-never bottleneck that arises from our fleeting memory, and explore its implications, e.g., chunk-and-pass ...
  • A formal context for acyclic join dependencies 

    Baixeries i Juvillà, Jaume (2017)
    Article
    Accés obert
    Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. This present work ...
  • The entropy of words-learnability and expressivity across more than 1000 languages 

    Bentz, Chris; Alikaniotis, Dimitrios; Cysouw, Michael; Ferrer Cancho, Ramon (2017-06-01)
    Article
    Accés obert
    The choice associated with words is a fundamental property of natural languages. It lies at the heart of quantitative linguistics, computational linguistics and language sciences more generally. Information theory gives ...
  • Disclosure day on relativity: a science activity beyond the classroom 

    Aragoneses, Andrés; Salán Ballesteros, Maria Núria; Hernández Fernández, Antonio (2017-04)
    Article
    Accés obert
    An important goal for students in engineering education is the ability to present and defend a project in front of a technical audience. We have designed an activity for helping students to work the independent learning ...
  • Random crossings in dependency trees 

    Ferrer Cancho, Ramon (2017-03-01)
    Article
    Accés obert
    It has been hypothesized that the rather small number of crossings in real syntactic dependency trees is a side-effect of pressure for dependency length minimization. Here we answer a related ...
  • A correction on Shiloach's algorithm for minimum linear arrangement of trees 

    Esteban Ángeles, Juan Luis; Ferrer Cancho, Ramon (2017-06-29)
    Article
    Accés obert
    More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on ...
  • Using the Marshall-Olkin extended Zipf distribution in graph generation 

    Duarte López, Ariel; Prat Pérez, Arnau; Pérez Casany, Marta (Springer, 2015-12-18)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Being able to generate large synthetic graphs resembling those found in the real world, is of high importance for the design of new graph algorithms and benchmarks. In this paper, we first compare several probability models ...
  • Machine learning assists the classification of reports by citizens on disease-carrying mosquitoes 

    Rodríguez García, Antonio; Bartumeus, Frederic; Gavaldà Mestre, Ricard (CEUR-WS.org, 2016)
    Comunicació de congrés
    Accés obert
    Mosquito Alert (www.mosquitoalert.com/en) is an expert-validated citizen science platform for tracking and controlling disease-carrying mosquitoes. Citizens download a free app and use their phones to send reports of ...
  • Grammar logicised: relativisation 

    Morrill, Glyn (2017-04-01)
    Article
    Accés obert
    Many variants of categorial grammar assume an underlying logic which is associative and linear. In relation to left extraction, the former property is challenged by island domains, which involve nonassociativity, and the ...
  • An alternative to CARMA models via iterations of Ornstein–Uhlenbeck processes 

    Arratia Quesada, Argimiro Alejandro; Cabaña, Ana Alejandra; Cabaña Perez, Enrique (Springer, 2015)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We present a new construction of continuous ARMA processes based on iterating an Ornstein–Uhlenbeck operator OUκ that maps a random variable y(t) onto OUκy(t)=∫t−∞e−κ(t−s)dy(s). This construction resembles the procedure ...

Mostra'n més