相关论文: Optimal Dual Frame Pairs: A Synergy with Graph The…
We study the graph matching problem in the presence of vertex feature information using shallow graph neural networks. Specifically, given two graphs that are independent perturbations of a single random geometric graph with sparse binary…
In modern communication systems such as the Internet, random losses of information can be mitigated by oversampling the source. This is equivalent to expanding the source using overcomplete systems of vectors (frames), as opposed to the…
Next generation communication systems require accurate beam alignment to counteract the impairments that characterize propagation in high-frequency bands. The overhead of the pilot sequences required to select the best beam pair is…
Optimal extraction is a key step in processing the raw images of spectra as registered by two-dimensional detector arrays to a one-dimensional format. Previously reported algorithms reconstruct models for a mean one-dimensional spatial…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
In this paper we raise the question of how to compress sparse graphs. By introducing the idea of redundancy, we find a way to measure the overlap of neighbors between nodes in networks. We exploit symmetry and information by making use of…
A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and…
We consider the following geometric optics problem: Construct a system of two reflectors which transforms a spherical wavefront generated by a point source into a beam of parallel rays. This beam has a prescribed intensity distribution. We…
Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or \iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the…
We give some new methods for perfect reconstruction from frame and sampling erasures in finitely many steps. By bridging an erasure set we mean replacing the erased Fourier coefficients of a function with respect to a frame by appropriate…
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…
Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For $n$-vertex and $m$-edge graphs, the best known algorithms run in…
In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…
We consider the design of an optimal collision-free sensor schedule for a number of sensors which monitor different linear dynamical systems correspondingly. At each time, only one of all the sensors can send its local estimate to the…
We present a pair of heuristic algorithms. The first is to generate a random regular graph of fixed size. The second is the introduction of the Metropolis Coupled Simulated Annealer (MCSA) for optimizing spectral gaps in fixed size regular…
Transmitted data may be corrupted by both noise and data loss. Grassmannian frames are in some sense optimal representations of data transmitted over a noisy channel that may lose some of the transmitted coefficients. Fusion frame (or frame…
Phase unwrapping is a key problem in many coherent imaging systems, such as synthetic aperture radar (SAR) interferometry. A general formulation for redundant integration of finite differences for phase unwrapping (Costantini et al., 2010)…
We investigate sublinear-time algorithms that take partially erased graphs represented by adjacency lists as input. Our algorithms make degree and neighbor queries to the input graph and work with a specified fraction of adversarial…
Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete…