Search
Search Results
-
On the Use of Deep Learning Models for Automatic Animal Classification of Native Species in the Amazon
Camera trap image analysis, although critical for habitat and species conservation, is often a manual, time-consuming, and expensive task. Thus,...
-
Spatial Shrinkage Prior: A Probabilistic Approach to Model for Categorical Variables with Many Levels
One of the most commonly used methods to prevent overfitting and select relevant variables in regression models with many predictors is the penalized...
-
The Importance of Knowing the Arrival Order in Combinatorial Bayesian Settings
We study the measure of order-competitive ratio introduced by Ezra et al. [16] for online algorithms in Bayesian combinatorial settings. In our...
-
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions
We consider fractional hedonic games, a natural and succinct subclass of hedonic games able to model many real-world settings in which agents have to...
-
Online Nash Welfare Maximization Without Predictions
The maximization of Nash welfare, which equals the geometric mean of agents’ utilities, is widely studied because it balances efficiency and fairness...
-
Equilibrium Analysis of Customer Attraction Games
We introduce a game model called “customer attraction game” to demonstrate the competition among online content providers. In this model, customers...
-
Target-Oriented Regret Minimization for Satisficing Monopolists
We study a robust monopoly pricing problem where a seller aspires to sell an item to a buyer. We assume that the seller, unaware of the buyer’s...
-
An Epistemological View of the Peano School Axiomatics
The paper advocates an epistemological interpretation of the Peano School axiomatics. The construction of axiom systems is presented as a cognitive...
-
Chains of Inferences in Proof by Induction: A Cognitive Analysis
In this paper, we investigate the students’ knowledge of proof by induction. We will focus on cognitive processes that appear fundamental in learning...
-
Assessing the Potential of Gene Tree Parsimony for Microbial Phylogenomics
A key challenge in microbial phylogenomics is that microbial gene families are often affected by extensive horizontal gene transfer (HGT). As a...
-
Evidence of Increased Adaptation of Omicron SARS-CoV-2 Codons to Humans
Viruses are highly dependent on their hosts to carry out cellular mechanisms and cause productive infection. Thus, they undergo extensive adaptations...
-
Revisiting the Effects of MDR1 Variants Using Computational Approaches
P-glycoprotein, encoded by the MDR1 gene, is an ATP-dependent pump that exports various substances out of cells. Its overexpression is related to...
-
Maximum Alternating Balanced Cycle Decomposition and Applications in Sorting by Intergenic Operations Problems
In the literature on genome rearrangement, several approaches use different structures to improve the results of genome rearrangement problems. In...
-
Gene Tree Parsimony in the Presence of Gene Duplication, Loss, and Incomplete Lineage Sorting
Inferring species trees from multi-locus data needs to account for gene tree discordance due to various biological processes, including incomplete...
-
Symmetries and Logical Visibility One More Time
My aim in this book was to explain the concept of mathematical structure and to show examples of techniques that are used to study them. It would be...
-
Logic of the Hide and Seek Game: Characterization, Axiomatization, Decidability
The logic of the hide and seek game \(\textsf{LHS}\) was...
-
Kleene Algebra of Weighted Programs with Domain
Weighted programs were recently introduced by Batz et al. (Proc. ACM Program. Lang. 2022) as a generalization of probabilistic programs which can...
-
Axiomatization of Hybrid Logic of Link Variations
In this paper, we investigate local and global dynamic modal operators which have the ability to update the accessibility relation of a model. For...
-
Parameterized Complexity
We look at the basics of parameterized complexity. This is a method which seeks to find tractability by limiting some parameter in the input. We...
-
NP- and PSPACE-Completeness
We introduce NP-completeness. We prove the Cook-Levin Theorem. Using it we prove many natural problems are NP-complete, and using similar ideas show...