相关论文: Detectability of labeled weighted automata over mo…

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

Detecting semantic parts of an object is a challenging task in computer vision, particularly because it is hard to construct large annotated datasets due to the difficulty of annotating semantic parts. In this paper we present an approach…

We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for each such weighted automaton, its run semantics and its…

In the autoencoder based anomaly detection paradigm, implementing the autoencoder in edge devices capable of learning in real-time is exceedingly challenging due to limited hardware, energy, and computational resources. We show that these…

There is a class of supersymmetric models which is well-motivated by hints of evidence for SUSY and consistent with all existing data. It is important to study the predictions of these models. They are characterized by M(N3) > M(C1) >…

We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system $P$, we prove that the following statements are equivalent, 1.…

The recent proof of the sharp weighted bound for Calder\'on-Zygmund operators has led to much investigation in sharp mixed bounds for operators and commutators, that is, a sharp weighted bound that is a product of at least two different…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…

This paper considers the problem of simultaneous sensor fault detection, isolation, and networked estimation of linear full-rank dynamical systems. The proposed networked estimation is a variant of single time-scale protocol and is based on…

Mechanistic interpretability aims to understand the internal mechanisms learned by neural networks. Despite recent progress toward this goal, it remains unclear how best to decompose neural network parameters into mechanistic components. We…

We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its…

A weighted Shiryaev-Roberts change detection procedure is shown to approximately minimize the expected delay to detection as well as higher moments of the detection delay among all change-point detection procedures with the given low…

We give different types of new characterizations for the boundedness and essential norms of generalized weighted composition operators between Zygmund type spaces. Consequently, we obtain new characterizations for the compactness of such…

We study observable sets for Schr\"odinger equations on combinatorial graphs. For one-dimensional lattice Schr\"odinger operators \(H=-\Delta_{\mathrm{disc}}+V\) with \(V(n)\to c\in\mathbb R\) as \(|n|\to\infty\), we prove that a set…

Current state-of-the-art deep learning systems for visual object recognition and detection use purely supervised training with regularization such as dropout to avoid overfitting. The performance depends critically on the amount of labeled…

We introduce weighted one-deterministic-counter automata (ODCA). These are weighted one-counter automata (OCA) with the property of counter-determinacy, meaning that all paths labelled by a given word starting from the initial configuration…

We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving…

We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with…

Most generic object detectors are mainly built for standard object detection tasks such as COCO and PASCAL VOC. They might not work well and/or efficiently on tasks of other domains consisting of images that are visually different from…

Fully-supervised salient object detection (SOD) methods have made great progress, but such methods often rely on a large number of pixel-level annotations, which are time-consuming and labour-intensive. In this paper, we focus on a new…