ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals: Enviaments recents
Ara es mostren els items 1-12 de 758
-
On the expected cost of partial match queries in random Quad-K-d trees
(Springer, 2024-03-04)
Article
Accés obertQuad-K-d trees introduced by Bereckzy et al. (In: Proceedings of the 11th Latin merican Theoretical Informatics Conference (LATIN). Lecture Notes in Computer Science, vol. 8392, pp. 743–754, 2014) are a generalization of ... -
Social disruption games in signed networks
(2024-05)
Article
Accés restringit per política de l'editorialSigned networks describe many real-world relations among users. Positive connections between two users or vertices generally mean good feelings between them, but negative connections mean bad feelings. A disruptor cycle ... -
The k-Robinson–Foulds dissimilarity measures for comparison of labeled treesd
(2024-01-25)
Article
Accés obertUnderstanding the mutational history of tumor cells is a critical endeavor in unraveling the mechanisms that drive the onset and progression of cancer. Modeling tumor cell evolution with labeled trees motivates researchers ... -
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 ... -
Weighted, circular and semi-algebraic proofs
(2024-02-11)
Article
Accés obertIn recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find ... -
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 ... -
New characterizations and a concept of potential for each multinomial (probabilistic) value
(Elsevier, 2024-05-15)
Article
Accés obertIn this paper we focus on multinomial probabilistic values and we consider two special classes of players: necessary and nullifying players. By introducing new properties related to this kind of players, we provide new ... -
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. ... -
Multidimension: a dimensionality extension of simple games
(Springer, 2023-10-20)
Article
Accés obertIn voting theory and social choice theory, decision systems can be represented as simple games, i.e., cooperative games defined through their players or voters and their set of winning coalitions. The weighted voting games ...
