Envíos recientes

  • Process windows 

    Mokhov, Andrey; Cortadella Fortuny, Jordi; de Gennaro, Alessandro (Institute of Electrical and Electronics Engineers (IEEE), 2017)
    Texto en actas de congreso
    Acceso abierto
    We describe a method for formally representing the behaviour of complex processes by process windows. Each window covers a part of the system behaviour, i.e. a part of the underlying transition system, and is easier to ...
  • Symbolic model generation for graph properties 

    Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (Springer, 2017)
    Texto en actas de congreso
    Acceso abierto
    Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to have the means to express and reason about graph properties. In particular, we want to be able to check automatically if a ...
  • UPC-USMBA at SemEval-2017 Task 3: Combining multiple approaches for CQA for Arabic 

    El Adlouni, Yassine; Lahbari, Imane; Rodríguez Hontoria, Horacio; Meknassi, Mohammed; El Alaoui, Said Ouatik; Ennahnahi, Noureddine (Association for Computational Linguistics, 2017)
    Comunicación de congreso
    Acceso abierto
    This paper presents a description of the participation of the UPC-USMBA team in the SemEval 2017 Task 3, subtask D, Arabic. Our approach for facing the task is based on a performance of a set of atomic classifiers (lexical ...
  • Syntactic methods for negation detection in radiology reports in Spanish 

    Cotik, Viviana; Stricker, Vanesa; Vivaldi, Jorge; Rodríguez Hontoria, Horacio (Association for Computational Linguistics, 2016)
    Texto en actas de congreso
    Acceso abierto
    Identification of the certainty of events is an important text mining problem. In particular, biomedical texts report medical conditions or findings that might be factual, hedged or negated. Identification ...
  • Reconciliando modularidad y eficiencia mediante atajos 

    Marco Gómez, Jordi; Franch Gutiérrez, Javier (Asociación Española de Informática y Automática (AEIA), 1997)
    Texto en actas de congreso
    Acceso abierto
    Se presenta en este artículo una propuesta para el desarrollo de programas eficientes en el marco de la programación con tipos abstractos de datos (TAD), con el objetivo de respetar la estructura modular de los programas ...
  • Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional Knapsack problem: Which one works better when? 

    Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian (Springer, 2017)
    Comunicación de congreso
    Acceso abierto
    Both, Construct, Merge, Solve and Adapt (CMSA) and Large Neighborhood Search (LNS), are hybrid algorithms that are based on iteratively solving sub-instances of the original problem instances, if possible, to optimality. ...
  • A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (Institute of Electrical and Electronics Engineers (IEEE), 2017)
    Comunicación de congreso
    Acceso abierto
    The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ...
  • An angel-daemon approach to assess the uncertainty in the power of a collectivity to act 

    Fragnito, Giulia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (Springer, 2017)
    Texto en actas de congreso
    Acceso abierto
    We propose the use of the angel-daemon framework to assess the Coleman's power of a collectivity to act under uncertainty in weighted voting games. In this framework uncertainty profiles describe the potential changes ...
  • Parsing logical grammar: CatLog3 

    Morrill, Glyn (Stockholm University, 2017)
    Texto en actas de congreso
    Acceso abierto
    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)
    Texto en actas de congreso
    Acceso abierto
    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 ...
  • Mobile graphics 

    Agus, Marco; Gobbetti, Enrico; Marton, Fabio; Pintore, Giovanni; Vázquez Alcocer, Pere Pau (European Association for Computer Graphics (Eurographics), 2017)
    Comunicación de congreso
    Acceso abierto
    The increased availability and performance of mobile graphics terminals, including smartphones and tablets with high resolution screens and powerful GPUs, combined with the increased availability of high-speed mobile data ...
  • Virtual reality to teach anatomy 

    Fairén González, Marta; Farrés, Mariona; Moyes Ardiaca, Jordi; Insa, Esther (European Association for Computer Graphics (Eurographics), 2017)
    Texto en actas de congreso
    Acceso abierto
    Virtual Reality (VR) and Augmented Reality (AR) have been gradually introduced in the curriculum of schools given the benefits they bring to classical education. We present an experiment designed to expose students to a ...

Muestra más