相关论文: Localization and projections on bi-parameter BMO

Bayesian Optimization (BO) is an effective method for finding the global optimum of expensive black-box functions. However, it is well known that applying BO to high-dimensional optimization problems is challenging. To address this issue, a…

A novel approach to Boolean matrix factorization (BMF) is presented. Instead of solving the BMF problem directly, this approach solves a nonnegative optimization problem with the constraint over an auxiliary matrix whose Boolean structure…

This article addresses the problem of existence of local factors, i.e., the root numbers and L-functions attached to representations of reductive groups over local fields and irreducible finite dimensional representations of their L-groups,…

By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…

In this paper, we study a class of pseudo-differential operators known as time-frequency localization operators on $\mathbb Z^n$, which depend on a symbol $\varsigma$ and two windows functions $g_1$ and $g_2$. We define the short-time…

We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…

We introduce the mixed Bourgain-Morrey spaces and obtain their preduals. The boundedness of Hardy-Littlewood maximal operator, iterated maximal operator, fractional integral operator, singular integral operator on these spaces is proved. In…

We study the space of local operators in the sinh-Gordon model in the framework of the bootstrap form factor approach. Our final goal is to identify the operators obtained by solving bootstrap equations with those defined in terms of the…

In this paper, we give the definability of bilinear singular and fractional integral operators on Morrey-Banach space, as well as their commutators and we prove the boundedness of such operators on Morrey-Banach spaces. Moreover, the…

Using the localization property, we construct a triangulated category of motives over quasi-projective T-schemes for any coefficient where T is a noetherian separated scheme, and we prove the Grothendieck six operations formalism. We also…

Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…

We first consider two types of localizations of singular integral operators of convolution type, and show, under mild decay and smoothness conditions on the auxiliary functions, that their boundedness on the local Hardy space…

Change detection process has recently progressed from a post-classification method to an expert knowledge interpretation process of the time-series data. The technique finds applications mainly in remote sensing images and can be utilized…

The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationally universal quantum medium. For genus $=0$…

Ground texture based localization is a promising approach to achieve high-accuracy positioning of vehicles. We present a self-contained method that can be used for global localization as well as for subsequent local localization updates,…

We introduce an approach for exploring eigenvector localization phenomena for a class of (unbounded) selfadjoint operators. More specifically, given a target region and a tolerance, the algorithm identifies candidate eigenpairs for which…

Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive…

Macro placement is the problem of placing memory blocks on a chip canvas. It can be formulated as a combinatorial optimization problem over sequence pairs, a representation which describes the relative positions of macros. Solving this…

Bayesian optimization (BO) is a powerful black-box optimization framework that looks to efficiently learn the global optimum of an unknown system by systematically trading-off between exploration and exploitation. However, the use of BO as…

This work extends the factorization method to the inverse scattering problem of reconstructing the shape and location of an absorbing penetrable scatterer embedded in a thin infinite elastic (Kirchhoff--Love) plate. With the assumption that…