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

  • 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 ...
  • Diameter minimization in networks for SIMD machines 

    Beivide Palacio, Ramon; Balcázar Navarro, José Luis (1985)
    Report de recerca
    Accés obert
    We propose an algebraic constructive method which allows to find a certain kind of networks having optimal diameter. These interconnection networks have been proposed for SIMD machines. We compare the results with other ...
  • Uniform characterizations of non-uniform complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ...
  • Deriving specifications of embeddings in recursive program design 

    Roselló Balanyà, Celestí; Balcázar Navarro, José Luis; Peña Marí, Ricardo (1989)
    Report de recerca
    Accés obert
    The design of recursive functions is a well-studied subject. Design methods require a specification to start with, however, when an embedding design is attempted at, it is not clear how the specification of the embedding ...
  • Characterization of the CPAP-treated patient population in Catalonia 

    Turino, Cecilia; Bertrán, Sandra; Gavaldà Mestre, Ricard; Teixidó, Ivan; Woehrle, Holger; Rué, Montserrat; Solsona, Francesc; Escarrabill, Joan; Colls, Cristina; García Altés, Anna; Batlle, Jordi de; Sánchez de la Torre, Manuel; Barbé, Ferran (2017-09-21)
    Article
    Accés obert
    There are different phenotypes of obstructive sleep apnoea (OSA), many of which have not been characterised. Identification of these different phenotypes is important in defining prognosis and guiding the therapeutic ...
  • Optimal distance networks of low degree for parallel computers 

    Beivide Palacio, Ramon; Herrada Lillo, Enrique; Balcázar Navarro, José Luis; Arruabarrena, Agustín (1989)
    Report de recerca
    Accés obert
    We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance ...
  • The placement of the head that maximizes predictability: An information theoretic approach 

    Ferrer Cancho, Ramon (RAM-Verlag, 2017-01-01)
    Article
    Accés obert
    The minimization of the length of syntactic dependencies is a well-established principle of word order and the basis of a mathematical theory of word order. Here we complete that theory from the perspective of information ...

Mostra'n més