A key challenge in visual place recognition (VPR) is recognizing places despite drastic appearance changes due to factors such as time of day, season, weather or lighting conditions. Numerous approaches based on deep-learnt image descriptors, sequence matching, domain translation, and probabilistic localization have had success addressing this challenge, but most rely the availability carefully...

How small can the diameter be made by adding a matching to an n-cycle? In this paper this question is answered by showing that the graph consisting of an n-cycle and a random matching has diameter about log2n, which is very close to the best possible value. It is also shown that by adding a random matching to graphs with certain expanding properties such as expanders or Ramanujan graphs, the re...

We study k-SVD that is to obtain the first k singular vectors of a matrix A approximately. Recently, a few breakthroughs have been discovered on k-SVD: Musco and Musco [18] provided the first gap-free theorem for the block Krylov method, Shamir [20] discovered the first variance-reduction stochastic method, and Bhojanapalli et al. [6] provided the fastest O(nnz(A) + poly(1/ε))-type of algorithm...

We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive convolution μ` ν of compactly supported probability measures in free probability. These decompositions are directly related to alternating decompositions of the ...

We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive convolution μ` ν of compactly supported probability measures in free probability. These decompositions are directly related to alternating decompositions of the ...

Consider a directed graph G in which every edge has an associated real-valued distance and a real-valued weight. The weight of an undirected circuit of G is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circuit minus the sum of the distances of the backward edges. A trivial circuit is a two-edge circuit...

Objective Stage N2-3 nasopharyngeal carcinoma (NPC) shows a high risk of distant metastasis, which will finally cause death. This study aimed to evaluate the impact of neoadjuvant chemotherapy (NACT) of various cycles before radical radiotherapy on distant metastasis and survival of patients with stage N2-3 diseases. Methods In this study, a total of 1,164 consecutive patients with non-metast...

In this article, we relate the spectrum of discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties graph: existence perfect matching and Hamiltonian cycle underlying graph. particular, give family spectral obstructions parametrised by potential for to be matchable (i.e., having matching) or cycle. We base our analysis special case preorder introduced in [8], us...