Enviaments recents

  • Dimension and codimension of simple games 

    Kurz, Sascha; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2016-11-01)
    Article
    Accés restringit per política de l'editorial
    This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with ...
  • The complexity of measuring power in generalized opinion leader decision models 

    Molinero Albareda, Xavier; Serna Iglesias, María José (2016-10)
    Article
    Accés restringit per política de l'editorial
    We analyze the computational complexity of the power measure in models of collective decision: the generalized opinion leader-follower model and the oblivious and non-oblivious infuence models. We show that computing the ...
  • Self-tracking reloaded: Applying process mining to personalized health care from labeled sensor data 

    Sztyler, Timo; Carmona Vargas, Josep; Völker, Johanna; Stuckenschmidt, Heiner (2016)
    Article
    Accés restringit per política de l'editorial
    Currently, there is a trend to promote personalized health care in order to prevent diseases or to have a healthier life. Using current devices such as smart-phones and smart-watches, an individual can easily record detailed ...
  • Mining conditional partial order graphs from event logs 

    Mokhov, Andrey; Carmona Vargas, Josep; Beaumont, Jonathan (2016)
    Article
    Accés restringit per política de l'editorial
    Process mining techniques rely on event logs: the extraction of a process model (discovery) takes an event log as the input, the adequacy of a process model (conformance) is checked against an event log, and the enhancement ...
  • A fast and retargetable framework for logic-IP-internal electromigration assessment comprehending advanced waveform effects 

    Jain, Palkesh; Cortadella Fortuny, Jordi; Sapatnekar, Sachin S. (2016-06-01)
    Article
    Accés obert
    A new methodology for system-on-chip-level logic-IP-internal electromigration verification is presented in this paper, which significantly improves accuracy by comprehending the impact of the parasitic RC loading and ...
  • Complexity and dynamics of the winemaking bacterial communities in berries, musts, and wines from apulian grape cultivars through time and space 

    Marzano, Marinella; Fosso, Bruno; Manzari, Caterina; Grieco, Francesco; Intranuovo, Marianna; Cozzi, Giuseppe; Mulè, Giuseppina; Scioscia, Gaetano; Valiente Feruglio, Gabriel Alejandro; Tullo, Apollonia; Sbisa, Elisabetta; Pesole, Graziano; Santamaria, Monica (2016-06-14)
    Article
    Accés obert
    Currently, there is very little information available regarding the microbiome associated with the wine production chain. Here, we used an amplicon sequencing approach based on high-throughput sequencing (HTS) to obtain a ...
  • Analysis of pivot sampling in dual-pivot Quicksort: A holistic analysis of Yaroslavskiy's partitioning scheme 

    Nebel, Markus E.; Wild, Sebastian; Martínez Parra, Conrado (2016-08)
    Article
    Accés obert
    The new dual-pivot Quicksort by Vladimir Yaroslavskiy-used in Oracle's Java runtime library since version 7-features intriguing asymmetries. They make a basic variant of this algorithm use less comparisons than classic ...
  • On the cost of fixed partial match queries in K-d trees 

    Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (2016-08-01)
    Article
    Accés restringit per política de l'editorial
    Partial match queries constitute the most basic type of associative queries in multidimensional data structures such as K-d trees or quadtrees. Given a query q=(q0,…,qK-1) where s of the coordinates are specified and K-s ...
  • Absorption time of the Moran process 

    Díaz Cort, Josep; Goldberg, Leslie Ann; Richerby, David; Serna Iglesias, María José (2016-08-01)
    Article
    Accés obert
    © 2016 Wiley Periodicals, Inc. The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly ...
  • On the complexity of exchanging 

    Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2016-02-04)
    Article
    Accés restringit per política de l'editorial
    We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning ...

Mostra'n més