Enviaments recents

  • On the consistency of circuit lower bounds for non-deterministic time 

    Atserias, Albert; Buss, Sam; Müller, Moritz (Association for Computing Machinery (ACM), 2023)
    Text en actes de congrés
    Accés obert
    We prove the first unconditional consistency result for superpolynomial circuit lower bounds with a relatively strong theory of bounded arithmetic. Namely, we show that the theory ‍V20 is consistent with the conjecture ...
  • WFAsic: A high-performance ASIC accelerator for DNA sequence alignment on a RISC-V SoC 

    Haghi, Abbas; Álvarez Martí, Lluc; Fornt Mas, Jordi; Haro Ruiz, Juan Miguel de; Figueras Bagué, Roger; Doblas Font, Max; Marco Sola, Santiago; Moretó Planas, Miquel (Association for Computing Machinery (ACM), 2023)
    Text en actes de congrés
    Accés obert
    The ever-increasing yields in genome sequence data production pose a computational challenge to current genome sequence analysis tools, jeopardizing the future of personalized medicine. Leveraging hardware accelerators ...
  • An aggregation rule under uncertainty 

    Freixas Bosch, Josep (2023)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Many decision-making situations require the evaluation of several agents or judges. In a situation where agents evaluate candidates, the question arises of how best to aggregate evaluations so as to compare the candidates. ...
  • Markov chains applied to Parrondo’s paradox: the coin tossing problem 

    Molinero Albareda, Xavier; Mégnien, Camille (2023)
    Text en actes de congrés
    Accés obert
    Parrondo’s paradox was introduced by Juan Parrondo in 1996. In game theory, this paradox is described as: A combination of losing strategies becomes a winning strategy. At first glance, this paradox is quite surprising, ...
  • How can graph databases and reasoning be combined and integrated? 

    Pasarella Sánchez, Ana Edelmira (Sociedad de Ingeniería de Software y Tecnologías de Desarrollo de Software (SISTEDES), 2022)
    Text en actes de congrés
    Accés obert
    Nowadays the graph data model has been accepted as one of the most suitable data models to formalize relationships among entities of many domains. Deductive databases based on the Datalog language have been used to deduce ...
  • Decomposition of transition systems into sets of synchronizing Free-choice Petri Nets 

    Teren, Viktor; Cortadella, Jordi; Villa, Tiziano (Institute of Electrical and Electronics Engineers (IEEE), 2022)
    Text en actes de congrés
    Accés obert
    Petri nets and transition systems are two important formalisms used for modeling concurrent systems. One interesting problem in this domain is the creation of a Petri net with a reachability graph equivalent to a given ...
  • Improved reconstruction of random geometric graphs 

    Dani, Varsha; Díaz Cort, Josep; Hayes, Thomas P.; Moore, Cristopher (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
    Text en actes de congrés
    Accés obert
    Embedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph ...
  • Negative learning ant colony optimization for network alignment 

    Rodríguez Corominas, Guillem; Blum, Christian; Blesa Aguilera, Maria Josep (Association for Computing Machinery (ACM), 2022)
    Text en actes de congrés
    Accés obert
    The Network Alignment problem is a hard Combinatorial Optimization problem with a wide range of applications, especially in computational biology. Given two (or more) networks, the goal is to find a mapping between their ...
  • Partial match queries in quad-K-d trees 

    Duch Brown, Amalia; Martínez Parra, Conrado (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
    Text en actes de congrés
    Accés obert
    Quad-K-d trees [Bereckzy et al., 2014] are a generalization of several well-known hierarchical Kdimensional data structures. They were introduced to provide a unified framework for the analysis of associative queries and ...
  • Affirmative sampling: theory and applications 

    Lumbroso, Jérémie; Martínez Parra, Conrado (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
    Text en actes de congrés
    Accés obert
    Affirmative Sampling is a practical and efficient novel algorithm to obtain random samples of distinct elements from a data stream. Its most salient feature is that the size S of the sample will, on expectation, grow with ...
  • On vanishing sums of roots of unity in polynomial calculus and sum-of-squares 

    Bonacina, Ilario; Galesi, Nicola; Lauria, Massimo (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
    Text en actes de congrés
    Accés obert
    Vanishing sums of roots of unity can be seen as a natural generalization of knapsack from Boolean variables to variables taking values over the roots of unity. We show that these sums are hard to prove for polynomial ...
  • Relating real and synthetic social networks through centrality measures 

    Blesa Aguilera, Maria Josep; Popa, Mihail Eduard; Serna Iglesias, María José (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
    Text en actes de congrés
    Accés obert
    We perform here a comparative study on the behaviour of real and synthetic social networks with respect to a selection of nine centrality measures. Some of them are topology based (degree, closeness, betweenness), while ...

Mostra'n més