Results 51 to 60 of about 16,030 (120)

The Evolving Landscape of Modern Regression: A Systematic Review and Mapping Study of Penalized, Algorithmic, and Interpretable Models

open access: yesWIREs Data Mining and Knowledge Discovery, Volume 16, Issue 1, March 2026.
This systematic review maps 50 years of regression methodology, tracing its evolution from ridge stabilization and penalized estimation to Bayesian, ensemble, and explainable‐AI frameworks. The analysis reveals a unified progression toward interpretable, cross‐domain modeling that integrates statistical rigor, computational scalability, and epistemic ...
Michael Bendersky, Shimon Fridkin
wiley   +1 more source

Go Green or Go Digital? A Set‐Theoretic Perspective of Incumbents' Paths to Success

open access: yesCreativity and Innovation Management, Volume 35, Issue 1, Page 125-142, March 2026.
ABSTRACT In response to growing pressures for environmental sustainability and technological advancement, this study examines how firms can effectively integrate green and digital innovations within ambidextrous strategies to enhance performance. Using fuzzy‐set Qualitative Comparative Analysis (fsQCA) on a sample of 175 German manufacturing and ...
Bettina Mayr
wiley   +1 more source

Zarankiewicz bounds from distal regularity lemma

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley   +1 more source

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

open access: yes, 2019
The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union ...
DiCarlo, Antonio   +4 more
core  

The First-Order Theory of Sets with Cardinality Constraints is Decidable

open access: yes, 2004
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is undecidable.
Kuncak, Viktor, Rinard, Martin
core   +3 more sources

On regular ultrafilters, Boolean ultrapowers, and Keisler's order

open access: yes, 2018
In this paper we analyse and compare two different notions of regularity for filters on complete Boolean algebras. We also announce two results from a forthcoming paper in preparation, which provide a characterization of Keisler's order in terms of ...
Parente, Francesco
core  

Home - About - Disclaimer - Privacy