English
Related papers

Related papers: Configuration space of intervals with partially su…

200 papers

Algebraic topological methods have been used successfully in concurrency theory, the domain of theoretical computer science that deals with distributed computing. L. Fajstrup, E. Goubault, and M. Raussen have introduced partially ordered…

Algebraic Topology · Mathematics 2007-05-23 Thomas Kahl

We study the task of testable learning of general -- not necessarily homogeneous -- halfspaces with adversarial label noise with respect to the Gaussian distribution. In the testable learning framework, the goal is to develop a…

Machine Learning · Computer Science 2024-09-02 Ilias Diakonikolas , Daniel M. Kane , Sihan Liu , Nikos Zarifis

We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an…

Combinatorics · Mathematics 2021-07-06 Jan Hubička , Matěj Konečný , Jaroslav Nešetřil

Learning with reduced labeling standards, such as noisy label, partial label, and multiple label candidates, which we generically refer to as \textit{imprecise} labels, is a commonplace challenge in machine learning tasks. Previous methods…

Machine Learning · Computer Science 2024-10-31 Hao Chen , Ankit Shah , Jindong Wang , Ran Tao , Yidong Wang , Xing Xie , Masashi Sugiyama , Rita Singh , Bhiksha Raj

Partial Label (PL) learning refers to the task of learning from the partially labeled data, where each training instance is ambiguously equipped with a set of candidate labels but only one is valid. Advances in the recent deep PL learning…

Machine Learning · Computer Science 2022-12-01 Ximing Li , Yuanzhi Jiang , Changchun Li , Yiyuan Wang , Jihong Ouyang

Described the algebraic structure on the space of homotopy classes of cycles with marked topological flags of disks. This space is a non-commutative monoid, with an Abelian quotient corresponding to the group of singular homologies…

Algebraic Topology · Mathematics 2007-05-23 Valery Dolotin

We compute the homology of the space of equivariant loops on the classifying space of a simplicial monoid $M$ with anti-involution, provided $\pi_0 (M)$ is central in the homology ring of $M$. The proof is similar to McDuff and Segal's…

K-Theory and Homology · Mathematics 2020-11-11 Kristian Jonsson Moi

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

Combinatorics · Mathematics 2014-10-22 Anders Claesson , Stuart A. Hannah

Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…

Algebraic Topology · Mathematics 2017-09-26 Nick Gurski , Niles Johnson , Angélica M. Osorno

In the present paper we study bundles equipped with extra homotopy conditions, in particular so-called simplicial $n$-bundles. It is shown that (under some condition) the classifying space of 1-bundles is the double coset space of some…

K-Theory and Homology · Mathematics 2008-08-31 A. V. Ershov

It is proved that the category of simplicial complete bornological spaces over $\mathbb R$ carries a combinatorial monoidal model structure satisfying the monoid axiom. For any commutative monoid in this category the category of modules is…

Differential Geometry · Mathematics 2017-07-31 Dennis Borisov , Kobi Kremnizer

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Representation Theory · Mathematics 2026-02-02 Henning Krause , Balduin Stoye

Algebraic topological methods have been used successfully in concurrency theory, the domain of theoretical computer science that deals with parallel computing. L. Fajstrup, E. Goubault, and M. Raussen have introduced partially ordered…

Algebraic Topology · Mathematics 2007-05-23 Thomas Kahl

We discuss, within the simplified context provided by the polymeric harmonic oscillator, a construction leading to a separable Hilbert space that preserves some of the most important features of the spectrum of the Hamiltonian operator.…

General Relativity and Quantum Cosmology · Physics 2016-08-11 J. Fernando Barbero G. , Tomasz Pawłowski , Eduardo J. S. Villaseñor

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

In analogy with the semi-Fibonacci partitions studied recently by Andrews, we define semi-Pell compositions and semi-$m$-Pell compositions. We find that these are in bijection with certain weakly unimodal $m$-ary compositions. We give…

Combinatorics · Mathematics 2019-12-25 William J. Keith , Augustine O. Munagi

We consider coherent sublinear expectations on a measurable space, without assuming the existence of a dominating probability measure. By considering a decomposition of the space in terms of the supports of the measures representing our…

Probability · Mathematics 2011-10-27 Samuel N. Cohen

This text gives a construction of a differential graded Lie algebra in Nori's category of effective homological motives. In fact the construction works in more a general setting than that of an Abelian category. This allows us to give the…

Algebraic Geometry · Mathematics 2007-05-23 Kaj Gartz

Partial multi-label learning and complementary multi-label learning are two popular weakly supervised multi-label classification paradigms that aim to alleviate the high annotation costs of collecting precisely annotated multi-label data.…

Machine Learning · Computer Science 2026-02-26 Wei Wang , Tianhao Ma , Ming-Kun Xie , Gang Niu , Masashi Sugiyama

In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An $s,t$ query computes the corresponding distance from the labels of $s$ and $t$ only, without looking at the input graph. Hub labels is…

Data Structures and Algorithms · Computer Science 2013-06-25 Andrew V. Goldberg , Ilya Razenshteyn , Ruslan Savchenko
‹ Prev 1 3 4 5 6 7 10 Next ›