相关论文: When LP is the Cure for Your Matching Woes: Approx…

This document is an exposition of an assortment of open problems arising from the exact enumeration of (perfect) matchings of finite graphs. Roughly half have been solved at the time of this writing; see the document "Twenty Open Problems…

In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…

This paper has been withdrawn by the author. This paper is now obsolete. For a solution please see: arXiv:/1205.4265.

This submission has been withdrawn by the authors because it is a duplicate of arXiv:hep-ph/0611336. It was due to a technical submission error by the authors.

In their recent paper titled "Large Associative Memory Problem in Neurobiology and Machine Learning" [arXiv:2008.06996] the authors gave a biologically plausible microscopic theory from which one can recover many dense associative memory…

The paper was withdrawn because of its significant overlap with a paper appeared recently.

We present a polylogarithmic local computation matching algorithm which guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of bounded degree.

This paper has been withdrawn by the author due to an extended and largely modified version of the paper was published in arXiv (see arXiv:0807.3694, Disjoint minimal graphs).

This paper has been withdrawn by the authors because it has been merged with paper arXiv:0903.3501v1 [math.DG]

An approximate textual retrieval algorithm for searching sources with high levels of defects is presented. It considers splitting the words in a query into two overlapping segments and subsequently building composite regular expressions…

Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani (1990) by associating the edges with success probabilities. This new…

This version of the paper has been withdrawn due to an error. Please contact one of the authors for an updated copy.

Because of the relevance of the results, this paper is merged into the paper titled "On the Number of Solutions to Asymptotic Plateau Problem" (arXiv:math.DG/0505593) as a new section.

It is well known that sparse approximation problem is \textsf{NP}-hard under general dictionaries. Several algorithms have been devised and analyzed in the past decade under various assumptions on the \emph{coherence} $\mu$ of the…

An existing solvability result for relaxed one-sided Lipschitz algebraic inclusions is substantially improved. This enhanced solvability result allows the design of a very robust numerical method for the approximation of a solution of the…

This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105

In this paper we consider convergence of approximate solutions of conservation laws. We start with an overview over the historical developments since the 1950s, and the analytical tools used in this context. Then we present some of our own…

Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…

A distance-based inconsistency indicator, defined by the third author for the consistency-driven pairwise comparisons method, is extended to the incomplete case. The corresponding optimization problem is transformed into an equivalent…

The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…