Related papers: Wavelet-Packet Content for Positive Operators
This work presents a discovery to advance the wisdom in a particular Succinct Data Structure: Wavelet Tree (Grossi, Gupta, and Vitter 2003). The discovery is first made by showing the feasibility of Reversed Indexes = Values: for integers…
In this paper we consider several problems of joint similarity to tuples of bounded linear operators in noncommutative polydomains and varieties associated with sets of noncommutative polynomials. We obtain analogues of classical results…
We present a new approximation algorithm for the treewidth problem which finds an upper bound on the treewidth and constructs a corresponding tree decomposition as well. Our algorithm is a faster variation of Reed's classical algorithm. For…
Given a positive definite, bounded linear operator $A$ on the Hilbert space $\mathcal{H}_0:=l^2(E)$, we consider a reproducing kernel Hilbert space $\mathcal{H}_+$ with a reproducing kernel $A(x,y)$. Here $E$ is any countable set and…
Geometric Attention (GA) specifies an attention layer by four independent inputs: a finite carrier (what indices are addressable), an evidence-kernel rule (how masked proto-scores and a link induce nonnegative weights), a probe family…
Aerial image segmentation is the basis for applications such as automatically creating maps or tracking deforestation. In true orthophotos, which are often used in these applications, many objects and regions can be approximated well by…
We give a complete description of bounded radial Toeplitz operators on the Hilbert space associated with a Cayley tree. As an application, we give a complete classification of a rich family of determinantal point processes on Cayley trees…
Consider two or more strings $\mathbf{x}^1,\mathbf{x}^2,\ldots,$ that are concatenated to form $\mathbf{x}=\langle \mathbf{x}^1,\mathbf{x}^2,\ldots \rangle$. Suppose that up to $\delta$ deletions occur in each of the concatenated strings.…
In applications, choices of orthonormal bases in Hilbert space H may come about from the simultaneous diagonalization of some specific abelian algebra of operators. It was noticed recently that there is a certain finite set of non-commuting…
Decision tree optimization is fundamental to interpretable machine learning. The most popular approach is to greedily search for the best feature at every decision point, which is fast but provably suboptimal. Recent approaches find the…
Speculative decoding accelerates Large Language Models via draft-then-verify, where verification can be framed as an Optimal Transport (OT) problem. Existing approaches typically handle multi-draft and multi-step aspects in isolation,…
Variational methods are widely applied to ill-posed inverse problems for they have the ability to embed prior knowledge about the solution. However, the level of performance of these methods significantly depends on a set of parameters,…
Tensor Robust Principal Component Analysis (TRPCA) is a fundamental technique for decomposing multi-dimensional data into a low-rank tensor and an outlier tensor, yet existing methods relying on sparse outlier assumptions often fail under…
We study the problem of object detection over scanned images of scientific documents. We consider images that contain objects of varying aspect ratios and sizes and range from coarse elements such as tables and figures to fine elements such…
In this paper, the notion of {\em $p$-adic multiresolution analysis (MRA)} is introduced. We use a ``natural'' refinement equation whose solution (a refinable function) is the characteristic function of the unit disc. This equation reflects…
This paper studies tensors that admit decomposition in the Extended Tensor Train (ETT) format, with a key focus on the case where some decomposition factors are constrained to be equal. This factor sharing introduces additional challenges,…
The current work generalizes the author's previous work on the infinite-dimensional Alpha Log-Determinant (Log-Det) divergences and Alpha-Beta Log-Det divergences, defined on the set of positive definite unitized trace class operators on a…
Let $\mathscr T$ be a rooted directed tree with finite branching index $k_{\mathscr T}$ and let $S_{\lambda} \in B(l^2(V))$ be a left-invertible weighted shift on ${\mathscr T}$. We show that $S_{\lambda}$ can be modelled as a…
The regularity of refinable functions has been investigated deeply in the past 25 years using Fourier analysis, wavelet analysis, restricted and joint spectral radii techniques. However the shift-invariance of the underlying regular setting…
The notion of $\mathcal{H}$-treewidth, where $\mathcal{H}$ is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly speaking, a graph of $\mathcal{H}$-treewidth at most $k$…