Results 91 to 100 of about 132,418 (291)
A Bijection between Lattice-Valued Filters and Lattice-Valued Congruences in Residuated Lattices
, 2013 The aim of this paper is to study relations between lattice-valued filters and lattice-valued congruences in residuated lattices. We introduce a new definition of congruences which just depends on the meet and the residuum . Then it is shown that each of
Wei Wei, Y. Qiang, Jing Zhang
semanticscholar +1 more source
Discrete Mathematics, 2013 AbstractWe provide a bijective proof of the identity ∑x∈λ(h(x)2−c(x)2)=|λ|2 where λ is an integer partition, h(x) is the hook number of the cell x∈λ, and c(x) is the content of x. A closely related identity is also proved bijectively.
openaire +2 more sources
Optimal Subsequence Bijection [PDF]
Seventh IEEE International Conference on Data Mining (ICDM 2007), 2007 We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirable to exclude the outlier elements from matching in order to obtain a robust matching performance. Moreover, in many applications like shape alignment or stereo correspondence
Qiang Wang +3 more
openaire +2 more sources
A sparse latent class model incorporating response times
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract Diagnostic models (DM) have been widely used to classify respondents' latent attributes in cognitive and non‐cognitive assessments. The integration of response times (RTs) with DM presents additional evidence to understand respondents' problem‐solving behaviours.
Siqi He +2 more
wiley +1 more source
Axis‐Normalized Ray‐Box Intersection
Computer Graphics Forum, EarlyView.Abstract Ray‐axis aligned bounding box intersection tests play a crucial role in the runtime performance of many rendering applications, driven not by complexity but mainly by the volume of tests required. While existing solutions were believed to be pretty much optimal in terms of runtime on current hardware, our paper introduces a new intersection ...
F. Friederichs +5 more
wiley +1 more source
Sca2Gri: Scalable Gridified Scatterplots
Computer Graphics Forum, EarlyView.Abstract Scatterplots are widely used in exploratory data analysis. Representing data points as glyphs is often crucial for in‐depth investigation, but this can lead to significant overlap and visual clutter. Recent post‐processing techniques address this issue, but their computational and/or visual scalability is generally limited to thousands of ...
S. Frey
wiley +1 more source
, 2014 In 2000, Babson and Steingr\'imsson introduced the notion of what is now known as a permutation vincular pattern, and based on it they re-defined known Mahonian statistics and introduced new ones, proving or conjecturing their Mahonity. These conjectures
Kitaev, Sergey, Vajnovszki, Vincent
core
An equivalence of multistatistics on permutations
, 2018 We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects, starting with a
Nunge, Arthur
core +2 more sources
A Bijection for Enriched Trees
European Journal of Combinatorics, 1994 AbstractLet R and F be two species, and let AR be the species of R-enriched trees. G. Labelle obtained a combinatorial proof of the fact that F(AR)[n] has the same cardinality as F′Rn[n -1] for any n ⩾ 1, where F′ is the derivative of F and [n] denotes the set {1, 2,…, n}.
openaire +2 more sources
International Transactions in Operational Research, EarlyView.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source