Related papers: WAP Systems and Labeled Subshifts
We construct the general supersymmetry algebra via the adjoint action on a semi-Hopf algebra which has a more general structure than a Hopf algebra. As a result we have an extended supersymmetry theory with quantum gauge group, i.e.,…
Starting with a set of weighted items, we want to create a generic sample of a certain size that we can later use to estimate the total weight of arbitrary subsets. For this purpose, we propose priority sampling which tested on Internet…
WAP protocol is a set of communication protocols application environment and wireless devices. WAP model more than a WAP gateway. Suitable for wireless communication environment.
The recent history of machine learning research has taught us that machine learning methods can be most effective when they are provided with very large, high-capacity models, and trained on very large and diverse datasets. This has spurred…
Parabosonic algebra in infinite degrees of freedom is presented as a generalization of the bosonic algebra, from the viewpoints of both physics and mathematics. The notion of super-Hopf algebra is shortly discussed and the super-Hopf…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Inspired by the Statistical Physics of complex networks, wireless multihop ad hoc communication networks are considered in abstracted form. Since such engineered networks are able to modify their structure via topology control, we search…
Automatic detection of speaker confidence is critical for adaptive computing but remains constrained by limited labelled data and the subjectivity of paralinguistic annotations. This paper proposes a semi-supervised hybrid framework that…
Providing technologies to communities or domains where training data is scarce or protected e.g., for privacy reasons, is becoming increasingly important. To that end, we generalise methods for unsupervised transfer from multiple input…
Weak supervision (WS) frameworks are a popular way to bypass hand-labeling large datasets for training data-hungry models. These approaches synthesize multiple noisy but cheaply-acquired estimates of labels into a set of high-quality…
The tacnode process is a universal determinantal point process arising from non-intersecting particle systems and tiling problems. It is the aim of this work to explore the integrable structure and large gap asymptotics for the gap…
The purpose of partial multi-label feature selection is to select the most representative feature subset, where the data comes from partial multi-label datasets that have label ambiguity issues. For label disambiguation, previous methods…
Bilingual Word Embeddings (BWEs) are one of the cornerstones of cross-lingual transfer of NLP models. They can be built using only monolingual corpora without supervision leading to numerous works focusing on unsupervised BWEs. However,…
Using a deterministic version of the self-similar (or hierarchical, or fixed-point ) method for constructing 2-dimensional subshifts of finite type (SFTs), we construct aperiodic 2D SFTs with a unique direction of non-expansiveness and…
We study the set of irregular points for topologically mixing subshifts of finite type. It is well known that despite the irregular set having zero measure for every invariant measure, it has full topological entropy and full Hausdorff…
We present a novel self-taught framework for unsupervised metric learning, which alternates between predicting class-equivalence relations between data through a moving average of an embedding model and learning the model with the predicted…
Nested space-filling designs are nested designs with attractive low-dimensional stratification. Such designs are gaining popularity in statistics, applied mathematics and engineering. Their applications include multi-fidelity computer…
In this work we construct subdivision schemes refining general subsets of R^n and study their applications to the approximation of set-valued functions. Differently from previous works on set-valued approximation, our methods are developed…
Recently proposed procedure of constructing maximally superintegrable systems of Winternitz type is further developed and illustrated by an example of system admitting an explicit construction of angle variables and additional integrals of…
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…