Enviaments recents

  • Anti-alignments in conformance checking: the dark side of process models 

    Chatain, Thomas; Carmona Vargas, Josep (Springer, 2016)
    Text en actes de congrés
    Accés obert
    Conformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the wellknown state space ...
  • Trade-offs between time and memory in a tighter model of CDCL SAT solvers 

    Elffers, J.; Johannsen, Jan; Lauria, Massimo; Magnard, Thomas; Nordström, Jakob; Vinyals, Marc (2016)
    Text en actes de congrés
    Accés obert
    A long line of research has studied the power of conflict- driven clause learning (CDCL) and how it compares to the resolution proof system in which it searches for proofs. It has been shown that CDCL can polynomially ...
  • Computing alignments with constraint programming : the acyclic case 

    Borrego, Diana; Gómez López, María Teresa; Carmona Vargas, Josep; Martínez Gasca, Rafael (CEUR-WS.org, 2016)
    Text en actes de congrés
    Accés obert
    Conformance checking confronts process models with real process executions to detect and measure deviations between modelled and observed behaviour. The core technique for conformance checking is the computation of an ...
  • Fraud detection in energy consumption: a supervised approach 

    Coma Puig, Bernat; Carmona Vargas, Josep; Gavaldà Mestre, Ricard; Alcoverro, Santiago; Martín, Victor (Institute of Electrical and Electronics Engineers (IEEE), 2016)
    Comunicació de congrés
    Accés obert
    Data from utility meters (gas, electricity, water) is a rich source of information for distribution companies, beyond billing. In this paper we present a supervised technique, which primarily but not only feeds on meter ...
  • Partial match queries in relaxed K-dt trees 

    Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador (Society for Industrial and Applied Mathematics (SIAM), 2017)
    Text en actes de congrés
    Accés obert
    The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval. It was not until recently that fixed (as ...
  • Mining structured Petri nets for the visualization of process behavior 

    San Pedro Martín, Javier de; Cortadella Fortuny, Jordi (Association for Computing Machinery (ACM), 2016)
    Text en actes de congrés
    Accés obert
    Visualization is essential for understanding the models obtained by process mining. Clear and efficient visual representations make the embedded information more accessible and analyzable. This work presents a novel approach ...
  • Comparing MapReduce and pipeline implementations for counting triangles 

    Pasarella Sánchez, Ana Edelmira; Vidal Serodio, Maria Esther; Zoltan, Cristina (2016)
    Text en actes de congrés
    Accés obert
    A generalized method to define the Divide & Conquer paradigm in order to have processors acting on its own data and scheduled in a parallel fashion. MapReduce is a programming model that follows this paradigm, and allows ...
  • A semantics of business configurations using symbolic graphs 

    Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando; Fiadeiro, José Luiz (Institute of Electrical and Electronics Engineers (IEEE), 2015)
    Text en actes de congrés
    Accés obert
    In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML: business configurations. To achieve this goal we use symbolic graph transformation systems. We formalize ...
  • Conditions for compatibility of components: The case of masters and slaves 

    Beek, Maurice ter; Carmona Vargas, Josep; Kleijn, Jetty (Springer, 2016)
    Text en actes de congrés
    Accés obert
    We consider systems composed of reactive components that collaborate through synchronised execution of common actions. These multi-component systems are formally represented as team automata, a model that allows a wide ...
  • Non-homogenizable classes of finite structures 

    Atserias, Albert; Torunczyk, Szymon Abram (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016)
    Text en actes de congrés
    Accés obert
    Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer ...

Mostra'n més