Ponències/Comunicacions de congressos
Enviaments recents
-
Polynomial calculus for MaxSAT
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023)
Text en actes de congrés
Accés obertMaxSAT is the problem of finding an assignment satisfying the maximum number of clauses in a CNF formula. We consider a natural generalization of this problem to generic sets of polynomials and propose a weighted version ... -
GMX: Instruction set extensions for fast, scalable, and efficient genome sequence alignment
(Association for Computing Machinery (ACM), 2023)
Text en actes de congrés
Accés obertSequence alignment remains a fundamental problem in computer science with practical applications ranging from pattern matching to computational biology. The ever-increasing volumes of genomic data produced by modern DNA ... -
The K-Robinson Foulds measures for labeled trees
(Springer, 2023)
Text en actes de congrés
Accés restringit per política de l'editorialInvestigating the mutational history of tumor cells is important for understanding the underlying mechanisms of cancer and its evolution. Now that the evolution of tumor cells is modeled using labeled trees, researchers ... -
On the consistency of circuit lower bounds for non-deterministic time
(Association for Computing Machinery (ACM), 2023)
Text en actes de congrés
Accés obertWe 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
(Association for Computing Machinery (ACM), 2023)
Text en actes de congrés
Accés obertThe 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
(2023)
Text en actes de congrés
Accés restringit per política de l'editorialMany 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
(2023)
Text en actes de congrés
Accés obertParrondo’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?
(Sociedad de Ingeniería de Software y Tecnologías de Desarrollo de Software (SISTEDES), 2022)
Text en actes de congrés
Accés obertNowadays 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
(Institute of Electrical and Electronics Engineers (IEEE), 2022)
Text en actes de congrés
Accés obertPetri 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
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
Text en actes de congrés
Accés obertEmbedding 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
(Association for Computing Machinery (ACM), 2022)
Text en actes de congrés
Accés obertThe 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
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
Text en actes de congrés
Accés obertQuad-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 ...
RSS 1.0